Article contents
A NOTE ON THE SINGULARITY OF ORIENTED GRAPHS
Published online by Cambridge University Press: 25 April 2022
Abstract
An oriented graph is called singular or nonsingular according as its adjacency matrix is singular or nonsingular. In this note, by a new approach, we determine the singularity of oriented quasi-trees. The main results of Chen et al. [‘Singularity of oriented graphs from several classes’, Bull. Aust. Math. Soc. 102(1) (2020), 7–14] follow as corollaries. Furthermore, we give a necessary condition for an oriented bipartite graph to be nonsingular. By applying this condition, we characterise nonsingular oriented bipartite graphs $B_{m,n}$ when $\min \{m,n\}\leq 3$ .
MSC classification
- Type
- Research Article
- Information
- Bulletin of the Australian Mathematical Society , Volume 106 , Issue 3 , December 2022 , pp. 357 - 362
- Copyright
- © The Author(s), 2022. Published by Cambridge University Press on behalf of Australian Mathematical Publishing Association Inc.
Footnotes
Supported by National Natural Science Foundation of China (12001010), Natural Science Foundation of Anhui Province (1908085QA31), China Postdoctoral Foundation (2019M662131).
References
- 1
- Cited by