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

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 $A\left(D\right)$ is nonsingular (singular). In this paper, we study the singularity of the oriented outerplanar graph with a given number of inner edges.