The Singularity of Oriented Outerplanar Graphs with a Given Number of Inner Edges

Borui He, Xianya Geng, Long Wang and Ali Jaballah

Journal of Mathematics, 2022, vol. 2022, 1-9

Abstract: A digraph is called oriented if there is at most one arc between two distinct vertices. An oriented graph is called nonsingular (singular) if its adjacency matrix AD is nonsingular (singular). In this paper, we study the singularity of the oriented outerplanar graph with a given number of inner edges.

Date: 2022
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/jmath/2022/1527031.pdf (application/pdf)
http://downloads.hindawi.com/journals/jmath/2022/1527031.xml (application/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jjmath:1527031

DOI: 10.1155/2022/1527031

Access Statistics for this article

More articles in Journal of Mathematics from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().