3 papers
math.CO2019
The complexity of total edge domination and some related results on trees
Zhuo Pan, Yu Yang, Xianyue Li +1
For a graph with vertex set and edge set , a subset of is called an (resp. a ) if every e…
math.CO2019
The LexCycle on -free Cocomparability Graphs
Xiao-Lu Gao, Shou-Jun Xu
A graph is a cocomparability graph if there exists an acyclic transitive orientation of the edges of its complement graph . LBFS is a variant of the generic…
math.CO2018
A Hopf algebra on subgraphs of a graph
Xiaomeng Wang, Shoujun Xu, Xing Gao
In this paper, we construct a bialgebraic and further a Hopf algebraic structure on top of subgraphs of a given graph. Further, we give the dual structure of this Hopf algebraic st…