The singularity of two kinds of tricyclic graphs
Let $ G $ be a finite simple graph and let $ A(G) $ be its adjacency matrix. Then $ G $ is $ singular $ if $ A(G) $ is singular. Suppose $ P_{b_{1}}, P_{b_{2}}, P_{b_{3}} $ are three paths with disjoint vertices, where $ b_i\geq 2 (i = 1, 2, 3) $, and at most one of them is 2. Coalescing together on...
Main Authors: | Haicheng Ma, Xiaojie You, Shuli Li |
---|---|
Format: | Article |
Language: | English |
Published: |
AIMS Press
2023-02-01
|
Series: | AIMS Mathematics |
Subjects: | |
Online Access: | https://www.aimspress.com/article/doi/10.3934/math.2023448?viewType=HTML |
Similar Items
-
The Singularity of Four Kinds of Tricyclic Graphs
by: Haicheng Ma, et al.
Published: (2022-11-01) -
On the inverse of the adjacency matrix of a graph
by: Farrugia Alexander, et al.
Published: (2013-11-01) -
Null Spaces Dimension of the Eigenvalue -1 in a Graph
by: Gohdar H. Mohiaddin, et al.
Published: (2019-10-01) -
Path energy of two kinds of special tricyclic graphs
by: Wenjing LI, et al.
Published: (2020-08-01) -
Minimum eigenvalue of the complement of tricyclic graphs with n-4 pendent vertexes
by: Hongjuan JU, et al.
Published: (2019-12-01)