The multiplicity of an arbitrary eigenvalue of a graph in terms of cyclomatic number and number of pendant vertices
From MaRDI portal
Publication:2332431
Recommendations
Cites work
- scientific article; zbMATH DE number 6100973 (Why is no real title available?)
- scientific article; zbMATH DE number 3414355 (Why is no real title available?)
- A characterization of graphs \(G\) with nullity \(|V(G)|-2m(G)+2c(G)\)
- A characterization of graphs with rank 4
- A characterization of graphs with rank 5
- A characterization of long graphs of arbitrary rank
- An upper bound for the nullity of a bipartite graph in terms of its maximum degree
- An upper bound of the nullity of a graph in terms of order and maximum degree
- Bounds for the matching number, the edge chromatic number and the independence number of a graph in terms of rank
- Nullity of a graph in terms of the dimension of cycle space and the number of pendant vertices
- On the Faria's inequality for the Laplacian and signless Laplacian spectra: a unified approach
- On the characterization of graphs with pendent vertices and given nullity
- On the multiplicity of as an A_()-eigenvalue of signed graphs with pendant vertices
- On the multiplicity of \(\alpha\) as an eigenvalue of \(A_\alpha(G)\) of graphs with pendant vertices
- On the nullity and the matching number of unicyclic graphs
- On the nullity of a graph with cut-points
- On the nullity of bicyclic graphs
- On the nullity of bipartite graphs
- On the nullity of bipartite graphs
- On the nullity of graphs
- On the nullity of line graphs of trees
- On the nullity of the line graph of unicyclic graph with depth one
- On the nullity of unicyclic graphs
- On the relation between theH-rank of a mixed graph and the matching number of its underlying graph
- On the relationship between the skew-rank of an oriented graph and the rank of its underlying graph
- On the trees with maximum nullity
- Permanental roots and the star degree of a graph
- Relation between the skew-rank of an oriented graph and the rank of its underlying graph
- Skew-rank of an oriented graph in terms of matching number
- Spectra of graphs
- Spektren endlicher Grafen
- The rank of a signed graph in terms of the rank of its underlying graph
- Trees with maximum nullity
Cited in
(17)- 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 nullity \(2c(G)+p(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
- Graphs with eigenvalue \(-1\) of multiplicity \(2 \theta (G)+ \rho (G) -1\)
- Graphs \(G\) with nullity \(n(G) - g(G) -1\)
- Graph transformations which preserve the multiplicity of an eigenvalue
- A characterization of trees with eigenvalue multiplicity one less than their number of pendant vertices
- The eigenvalue multiplicity of line graphs
- Characterization of graphs with eigenvalue multiplicity one less than the number of external vertices
- Trees with one as Laplacian eigenvalue with multiplicity two less than the number of pendant vertices
- Eigenvalue multiplicity of graphs with given cyclomatic number and given number of quasi-pendant vertices
- A note on the multiplicities of graph eigenvalues
- Eigenvalue multiplicity of a graph in terms of the number of external vertices
- A characterization for a graph with an eigenvalue of multiplicity \(2c(G)+p(G) - 1\)
- Line graphs with the largest eigenvalue multiplicity
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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2332431)
