5 citations · 6 across the 5 of their papers we have counts for
7 papers
Hadwiger's conjecture for the complements of Kneser graphs
Guangjun Xu, Sanming Zhou
Hadwiger's conjecture asserts that every graph with chromatic number contains a complete minor of order . Given integers , the Kneser graph is th…
Three-arc graphs: characterization and domination
Guangjun Xu, Sanming Zhou
An arc of a graph is an oriented edge and a 3-arc is a 4-tuple of vertices such that both and are paths of length two. The 3-arc graph of a graph $G…
Hadwiger's conjecture for 3-arc graphs
David R. Wood, Guangjun Xu, Sanming Zhou
The 3-arc graph of a digraph is defined to have vertices the arcs of such that two arcs are adjacent if and only if and are distinct arcs of with $v\…
On the determinant of the distance matrix of a bicyclic graph
Shi-Cai Gong, Ju-Li Zhang, Guang-Hui Xu
Two cycles are referred as disjoint if they have no common edges. In this paper, we will investigate the determinant of the distance matrix of a graph, giving a formula for the det…
Symmetric graphs with 2-arc transitive quotients
Guangjun Xu, Sanming Zhou
A graph $\Ga$ is -symmetric if $\Ga$ admits as a group of automorphisms acting transitively on the set of vertices and the set of arcs of $\Ga$, where an arc is an ordered p…
Hamiltonicity of 3-arc graphs
Guangjun Xu, Sanming Zhou
An arc of a graph is an oriented edge and a 3-arc is a 4-tuple of vertices such that both and are paths of length two. The 3-arc graph of a graph $G…