Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-17T07:03:30.266Z Has data issue: false hasContentIssue false

SINGULARITY OF ORIENTED GRAPHS FROM SEVERAL CLASSES

Part of:Graph theory

Published online by Cambridge University Press:  21 November 2019

XIAOXUAN CHEN
Affiliation:
School of Mathematics and Big Data, Anhui University of Science and Technology, Huainan, China email 765834082@qq.com
JING YANG*
Affiliation:
School of Mathematics and Big Data, Anhui University of Science and Technology, Huainan, China email jyang@aust.edu.cn
XIANYA GENG
Affiliation:
School of Mathematics and Big Data, Anhui University of Science and Technology, Huainan, China email gengxianya@sina.com
LONG WANG
Affiliation:
School of Mathematics and Big Data, Anhui University of Science and Technology, Huainan, China email wanglongxuzhou@126.com
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

A digraph is called oriented if there is at most one arc between two distinct vertices. An oriented graph $D$ is nonsingular if its adjacency matrix $A(D)$ is nonsingular. We characterise all nonsingular oriented graphs from three classes: graphs in which cycles are vertex disjoint, graphs in which all cycles share exactly one common vertex and graphs formed by cycles sharing a common path. As a straightforward corollary, the singularity of oriented bicyclic graphs is determined.

Information

Type
Research Article
Copyright
© 2019 Australian Mathematical Publishing Association Inc.