The multiplicity of an arbitrary eigenvalue of a graph in terms of cyclomatic number and number of pendant vertices
From MaRDI portal
Publication:2332431
DOI10.1016/j.laa.2019.09.013zbMath1426.05112OpenAlexW2974378790WikidataQ114664036 ScholiaQ114664036MaRDI QIDQ2332431
Publication date: 4 November 2019
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2019.09.013
Related Items (9)
On connected graphs of order \(n\) with girth \(g\) and nullity \(n-g\) ⋮ Relation between the nullity of a graph and its matching number ⋮ Graphs with eigenvalue \(-1\) of multiplicity \(2 \theta (G)+ \rho (G) -1\) ⋮ Graphs \(G\) with nullity \(n(G) - g(G) -1\) ⋮ On the multiplicity of −1 as an eigenvalue of a tree with given number of pendant vertices ⋮ The multiplicity of an \(A_\alpha \)-eigenvalue: a unified approach for mixed graphs and complex unit gain graphs ⋮ A characterization of trees with eigenvalue multiplicity one less than their number of pendant vertices ⋮ Eigenvalue multiplicity of graphs with given cyclomatic number and given number of quasi-pendant vertices ⋮ Graphs with nullity \(2c(G)+p(G)-1\)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Nullity of a graph in terms of the dimension of cycle space and the number of pendant vertices
- A characterization of graphs with rank 5
- On the nullity of the line graph of unicyclic graph with depth one
- A characterization of graphs \(G\) with nullity \(|V(G)|-2m(G)+2c(G)\)
- A characterization of graphs with rank 4
- On the nullity of a graph with cut-points
- Spectra of graphs
- On the relationship between the skew-rank of an oriented graph and the rank of its underlying graph
- Spektren endlicher Grafen
- Permanental roots and the star degree of a graph
- On the nullity and the matching number of unicyclic graphs
- On the nullity of bicyclic graphs
- An upper bound of the nullity of a graph in terms of order and maximum degree
- The rank of a signed graph in terms of the rank of its underlying graph
- On the multiplicity of \(\alpha\) as an eigenvalue of \(A_\alpha(G)\) of graphs with pendant vertices
- Trees with maximum nullity
- A characterization of long graphs of arbitrary rank
- On the Faria's inequality for the Laplacian and signless Laplacian spectra: a unified approach
- On the multiplicity of \(\alpha\) as an \(A_\alpha(\varGamma)\)-eigenvalue of signed graphs with pendant vertices
- On the nullity of unicyclic graphs
- Bounds for the matching number, the edge chromatic number and the independence number of a graph in terms of rank
- An upper bound for the nullity of a bipartite graph in terms of its maximum degree
- On the nullity of graphs
- On the relation between theH-rank of a mixed graph and the matching number of its underlying graph
- On the nullity of bipartite graphs
- On the nullity of bipartite graphs
- On the nullity of line graphs of trees
- Skew-rank of an oriented graph in terms of matching number
- Relation between the skew-rank of an oriented graph and the rank of its underlying graph
This page was built for publication: The multiplicity of an arbitrary eigenvalue of a graph in terms of cyclomatic number and number of pendant vertices
