Guangjun Xu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Guangjun Xu has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Sanming Zhou
School of Mathematics and Statistics, The University of Melbourne, Parkville, Australia
2 shared publications - Jun He
School of mathematics, Zunyi Normal College, Zunyi, People’s Republic of China
1 shared publication - Qiang Sun
School of Mathematical Science, Yangzhou University, Yangzhou 225002, China
1 shared publication - Yanmin Liu
School of Mathematics, Zunyi Normal College, Zunyi, Guizhou 563006 China
1 shared publication - Zuosong Liang
Guangxi Minzu University, Nanning, China, China
1 shared publication
Latest Publications
- Open Access
- 28 April 2022
- Published by Wiley in Computational Intelligence and Neuroscience
- Vol. 2022, 1-6
On Hamiltonian Decomposition Problem of 3-Arc Graphs
A 4-tuple in a graph is a 3-arc if each of and is a path. The 3-arc graph of is the graph with vertex set all arcs of and edge set containing all edges joining and whenever is a 3-arc of . A Hamilton cycle is a closed path meeting each vertex of a graph. A graph including a Hamilton cycle is called Hamiltonian and has a Hamiltonian decomposition provided its edge set admits a partition into disjoint Hamilton cycles (possibly with a single perfect matching). The current paper proves that every connected 3-arc graph consists of more than one Hamilton cycle. Since the 3-arc graph of a cubic graph is 4-regular, it further proves that each 3-arc graph of a cubic graph in a certain family has a Hamiltonian decomposition.
- 28 April 2022
- Published by Wiley in Computational Intelligence and Neuroscience
- Vol. 2022, 1-6
Open AccessOn Hamiltonian Decomposition Problem of 3-Arc Graphs
A 4-tuple in a graph is a 3-arc if each of and is a path. The 3-arc graph of is the graph with vertex set all arcs of and edge set containing all edges joining and whenever is a 3-arc of . A Hamilton cycle is a closed path meeting each vertex of a graph. A graph including a Hamilton cycle is called Hamiltonian and has a Hamiltonian decomposition provided its edge set admits a partition into disjoint Hamilton cycles (possibly with a single perfect matching). The current paper proves that every connected 3-arc graph consists of more than one Hamilton cycle. Since the 3-arc graph of a cubic graph is 4-regular, it further proves that each 3-arc graph of a cubic graph in a certain family has a Hamiltonian decomposition.
- Open Access
- 1 January 2021
- Published by Science Society of Thailand in ScienceAsia
- Vol. 47 (2) , 257-263
Rectangular M-tensors and strong rectangular M-tensors
- 1 January 2021
- Published by Science Society of Thailand in ScienceAsia
- Vol. 47 (2) , 257-263
Open AccessRectangular M-tensors and strong rectangular M-tensors
- Open Access
Three-arc graphs: characterization and domination
An arc of a graph is an oriented edge and a 3-arc is a 4-tuple $(v,u,x,y)$ of vertices such that both $(v,u,x)$ and $(u,x,y)$ are paths of length two. The 3-arc graph of a graph $G$ is defined to have vertices the arcs of $G$ such that two arcs $uv, xy$ are adjacent if and only if $(v,u,x,y)$ is a 3-arc of $G$. In this paper we give a characterization of 3-arc graphs and obtain sharp upper bounds on the domination number of the 3-arc graph of a graph $G$ in terms that of $G$.Open AccessThree-arc graphs: characterization and domination
An arc of a graph is an oriented edge and a 3-arc is a 4-tuple $(v,u,x,y)$ of vertices such that both $(v,u,x)$ and $(u,x,y)$ are paths of length two. The 3-arc graph of a graph $G$ is defined to have vertices the arcs of $G$ such that two arcs $uv, xy$ are adjacent if and only if $(v,u,x,y)$ is a 3-arc of $G$. In this paper we give a characterization of 3-arc graphs and obtain sharp upper bounds on the domination number of the 3-arc graph of a graph $G$ in terms that of $G$. - Open Access
- 18 June 2010
- Published by Cambridge University Press (CUP) in Bulletin of the Australian Mathematical Society
- Vol. 82 (1) , 79-83
SOLUTION TO A QUESTION ON A FAMILY OF IMPRIMITIVE SYMMETRIC GRAPHS
We answer a recent question posed by Li et al. [‘Imprimitive symmetric graphs with cyclic blocks’, European J. Combin.31 (2010), 362–367] regarding a family of imprimitive symmetric graphs.
- 18 June 2010
- Published by Cambridge University Press (CUP) in Bulletin of the Australian Mathematical Society
- Vol. 82 (1) , 79-83
Open AccessSOLUTION TO A QUESTION ON A FAMILY OF IMPRIMITIVE SYMMETRIC GRAPHS
We answer a recent question posed by Li et al. [‘Imprimitive symmetric graphs with cyclic blocks’, European J. Combin.31 (2010), 362–367] regarding a family of imprimitive symmetric graphs.