On graphs with exactly two positive eigenvalues

DOI10.26493/1855-3974.1516.58FMaRDI QIDQ5217076zbMATH OpenOpenAlexWikidataFDO

Authors Fang Duan, Xueyi Huang, Qiongxiang Huang

Publication date 21 February 2020

Published in Ars Mathematica Contemporanea (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1805.08031

zbMATH Keywords

congruent transformationnullitypositive (negative) inertia index

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Abstract: The inertia of a graph $G$ is defined to be the triplet $In(G)=(p(G),n(G),$ $eta(G))$, where $p(G)$, $n(G)$ and $eta(G)$ are the numbers of positive, negative and zero eigenvalues (including multiplicities) of the adjacency matrix $A(G)$, respectively. Traditionally $p(G)$ (resp. $n(G)$) is called the positive (resp. negative) inertia index of $G$. In this paper, we introduce three types of congruent transformations for graphs that keep the positive inertia index and negative inertia index. By using these congruent transformations, we determine all graphs with exactly two positive eigenvalues and one zero eigenvalue.

Recommendations

• Signed graphs with small positive index of inertia
• A complete characterization of graphs with exactly two positive eigenvalues
• Graphs with Exactly Two Negative Eigenvalues
• Graphs with small negative inertia index
• Bounds for the positive and negative inertia index of a graph

Cites work

• Bipartite graphs with at most six non-zero eigenvalues
• Characterization of graphs with exactly two non-negative eigenvalues
• Graphs with a small number of nonnegative eigenvalues
• scientific article; zbMATH DE number 1600999 (Why is no real title available?)
• scientific article; zbMATH DE number 3580591 (Why is no real title available?)
• On graphs with a fixed number of negative eigenvalues
• On graphs with exactly one eigenvalue less than -1
• On the third largest eigenvalue of graphs
• Positive and negative inertia index of a graph

Cited in

(20)

• A complete characterization of graphs with exactly two positive eigenvalues
• Graph covers with two new eigenvalues
• Undirected graphs of Hermitian matrices that admit only two distinct eigenvalues
• The positive and the negative inertia index of line graphs of trees
• Positive and negative inertia indexes and nullity of two kinds of tricyclic graphs
• Bounding the inertia of graphs under some graph operations
• The characterization of graph by positive inertia index.
• A note on graphs with exactly two main eigenvalues
• Graphs with Exactly Two Negative Eigenvalues
• scientific article; zbMATH DE number 32147 (Why is no real title available?)
• scientific article; zbMATH DE number 6129825 (Why is no real title available?)
• On the Aα-spectral radius of connected graphs
• Characterizations of graphs with given inertia index achieving the maximum diameter
• Small graphs with exactly two non-negative eigenvalues
• Graphs with small negative inertia index
• Triangle-free graphs with six non-zero eigenvalues
• On graphs with girth \(g\) and positive inertia index of \(\frac{\lceil g\rceil}{2}-1\) and \(\frac{\lceil g\rceil}{2}\)
• On claw-free graphs with all but four eigenvalues equal to \(0\) or \(-1\)
• Spectral deviations of graphs
• On triangle-free graphs with rank 7

This page was built for publication: On graphs with exactly two positive eigenvalues

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5217076)