A characterization of graphs with two types of eigenvalue multiplicities equal to n - d - 1

DOI10.1016/J.DAM.2025.07.005MaRDI QIDQ6906765zbMATH OpenFDO

Authors Jinxing Zhao

Publication date 4 November 2025

Published in Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

diameterextremal graphsnullity

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Extremal problems in graph theory (05C35) Distance in graphs (05C12)

Cites work

• A characterization of graphs \(G\) with nullity \(|V(G)|-2m(G)+2c(G)\)
• A characterization of long graphs of arbitrary rank
• An extension of the star complement technique for regular graphs
• An introduction to the theory of graph spectra
• Bounds for the matching number and cyclomatic number of a signed graph in terms of rank
• Bounds for the matching number, the edge chromatic number and the independence number of a graph in terms of rank
• Characterization of graphs with given order, given size and given matching number that minimize nullity
• Characterization of sub-long graphs of arbitrary rank
• Complex unit gain graphs of rank 2
• Geometric vs algebraic nullity for hyperpaths
• Graphs \(G\) with nullity \(n(G) - g(G) -1\)
• Graphs with eigenvalue \(-1\) of multiplicity \(2 \theta (G)+ \rho (G) -1\)
• Minimal graphs with eigenvalue multiplicity of \(n-d\)
• No graph with nullity \(\eta(G) = | V(G) | - 2 m(G) + 2 c(G) - 1\)
• Nullity of a graph in terms of the dimension of cycle space and the number of pendant vertices
• On graphs with exactly one eigenvalue less than -1
• On multiple eigenvalues of trees
• On the multiplicity of \(-1\) as an eigenvalue of a tree with given number of pendant vertices
• On the nullity and the matching number of unicyclic graphs
• On the nullity of bipartite graphs
• On the relation between theH-rank of a mixed graph and the matching number of its underlying graph
• Relation between the skew-rank of an oriented graph and the rank of its underlying graph
• Spectra of graphs. Theory and application
• Spektren endlicher Grafen
• The characterization of the minimal weighted acyclic graphs
• The extremal graphs with respect to their nullity
• The multiplicities of eigenvalues of a graph
• The nullity of a graph with fractional matching number
• The rank of a complex unit gain graph in terms of the matching number
• The rank of a signed graph

This page was built for publication: A characterization of graphs with two types of eigenvalue multiplicities equal to \(n - d - 1\)

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