The leaf-free graphs with nullity 2 c ( G ) - 1
From MaRDI portal
Publication:2306583
Recommendations
Cites work
- 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
- A note on the nullity of unicyclic graphs
- 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
- scientific article; zbMATH DE number 5642062 (Why is no real title available?)
- scientific article; zbMATH DE number 3717357 (Why is no real title available?)
- scientific article; zbMATH DE number 3414355 (Why is no real title available?)
- Nullity of a graph in terms of the dimension of cycle space and the number of pendant vertices
- Nullity of graphs: an updated survey
- 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 graphs with pendent vertices
- On the nullity of unicyclic graphs
- 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
- Spektren endlicher Grafen
- The nullity of \(k\)-cyclic graphs of \(\infty\)-type
- Trees with maximum nullity
Cited in
(17)- Graphs \(G\) with nullity \(2c(G) + p(G) - 1\)
- Graphs with nullity \(2c(G)+p(G)-1\)
- Graphs with eigenvalue \(-1\) of multiplicity \(2 \theta (G)+ \rho (G) -1\)
- Graphs \(G\) with nullity \(n(G) - g(G) -1\)
- On connected signed graphs with rank equal to girth
- Bounds for the rank of a complex unit gain graph in terms of its maximum degree
- scientific article; zbMATH DE number 7692350 (Why is no real title available?)
- Nullities of cycle-spliced bipartite graphs
- The nullities of signed cycle-spliced 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
- A characterization for a graph with an eigenvalue of multiplicity \(2c(G)+p(G) - 1\)
- The gap between the rank of a complex unit gain graph and its underlying graph
- The eigenvalue multiplicity of line graphs
- Characterization of graphs with eigenvalue multiplicity one less than the number of external vertices
- Bounding the multiplicities of eigenvalues of graph matrices in terms of circuit rank
- On connected graphs of order n with girth g and nullity n-g
This page was built for publication: The leaf-free graphs with nullity \(2 c ( G ) - 1\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2306583)