On the positive and negative inertia of weighted graphs

2013/07/19 by Shuchao Li, Li, Shuchao, Feifei Song +1
Computer Science · Mathematics · #05C50 #15A18 #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Graph theory and applications #Matrix Theory and Algorithms #math.CO #msc:05C50 #msc:15A18

paper · pdf · doi:10.48550/arxiv.1307.5110

12. arXiv admin note: text overlap with arXiv:1107.0400 by other authors

arxiv created 2013/07/19 · openalex publication_date 2013/07/19 · arxiv updated 2013/07/22 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

The number of the positive, negative and zero eigenvalues in the spectrum of the (edge)-weighted graph G are called positive inertia index, negative inertia index and nullity of the weighted graph G, and denoted by i₊(G), i_-(G), i₀(G), respectively. In this paper, the positive and negative inertia index of weighted trees, weighted unicyclic graphs and weighted bicyclic graphs are discussed, the methods of calculating them are obtained.

Citations

• A note on the nullity of unicyclic signed graphs

Related

• The extremal problems on the inertia of weighted bicyclic graphs
• The inertia of weighted unicyclic graphs
• On graphs with exactly two positive eigenvalues
• On the inertia index of a mixed graph with the matching number
• The relationship between the negative inertia index of graph G and its girth g and diameter d