Nullity of a graph in terms of the dimension of cycle space and the number of pendant vertices
From MaRDI portal
(Redirected from Publication:323069)
Recommendations
- On the nullity of graphs with pendent vertices
- The nullity of \((k-1)\)-cyclic graphs
- On the characterization of graphs with pendent vertices and given nullity
- On the nullity of bicyclic graphs
- scientific article; zbMATH DE number 5642062
- On the nullity of graphs with pendant trees
- On the nullity number of graphs
- Note on the nullity of bicyclic graphs
- Nullity of a graph in terms of path cover number
- On nullity set of bicyclic graphs
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 with rank 4
- A characterization of graphs with rank 5
- A characterization of long graphs of arbitrary rank
- Bounds for the matching number, the edge chromatic number and the independence number of a graph in terms of rank
- On the characterization of graphs with pendent vertices and given nullity
- 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 line graphs of trees
- On the nullity of the line graph of unicyclic graph with depth one
- On the nullity of tricyclic graphs
- On the nullity of unicyclic graphs
- On the trees with maximum nullity
- Spektren endlicher Grafen
- The Gewirtz graph: An exercise in the theory of graph spectra
- Trees with maximum nullity
Cited in
(47)- The multiplicity of an arbitrary eigenvalue of a graph in terms of cyclomatic number and number of pendant vertices
- The rank of a complex unit gain graph in terms of the rank of its underlying graph
- Relation between the inertia indices of a complex unit gain graph and those of its underlying graph
- A survey of the maximal and the minimal nullity in terms of omega invariant on graphs
- Relationship between the rank and the matching number of a graph
- The nullity of a graph with fractional matching number
- Relation between the \(H\)-rank of a mixed graph and the rank of its underlying graph
- On connected signed graphs with rank equal to girth
- The gap between the rank of a complex unit gain graph and its underlying graph
- On the inertia index of a mixed graph in terms of the matching number
- On the relation between theH-rank of a mixed graph and the matching number of its underlying graph
- On connected graphs of order \(n\) with girth \(g\) and nullity \(n-g\)
- Line graphs of trees with the largest eigenvalue multiplicity
- scientific article; zbMATH DE number 7692350 (Why is no real title available?)
- Proof of a conjecture on the nullity of a graph
- Eigenvalue multiplicity of graphs with given cyclomatic number and given number of quasi-pendant vertices
- On connected \(\mathbb{T}\)-gain graphs with rank equal to girth
- Skew-rank of an oriented graph in terms of the rank and dimension of cycle space of its underlying graph
- Bounds of nullity for complex unit gain graphs
- Graphs \(G\) with nullity \(2c(G) + p(G) - 1\)
- Graphs \(G\) with nullity \(n(G) - g(G) -1\)
- On the characteristic polynomials and \(H\)-ranks of the weighted mixed graphs
- The multiplicities of eigenvalues of a graph
- The relation between the \(H\)-rank of a mixed graph and the independence number of its underlying graph
- An upper bound of the nullity of a graph in terms of order and maximum degree
- Graphs with nullity \(2c(G)+p(G)-1\)
- The rank of a complex unit gain graph in terms of the matching number
- Nullity of a graph in terms of path cover number
- Relation between the rank of a signed graph and the rank of its underlying graph
- On the multiplicity of an arbitrary \(A_\alpha\)-eigenvalue of a connected graph
- An improved lower bound for the nullity of a graph in terms of matching number
- A characterization for a graph with an eigenvalue of multiplicity \(2c(G)+p(G) - 1\)
- On the multiplicity of \(\alpha\) as an eigenvalue of the \(a_\alpha\) matrix of a graph in terms of the number of pendant vertices
- The rank of a signed graph in terms of the rank of its underlying graph
- A characterization of trees with eigenvalue multiplicity one less than their number of pendant vertices
- Relation between the skew-rank of an oriented graph and the independence number of its underlying graph
- Nullities of graphs with given order, matching number and cyclomatic number revisited
- The nullities of signed cycle-spliced graphs
- The leaf-free graphs with nullity \(2 c ( G ) - 1\)
- Graphs with eigenvalue \(-1\) of multiplicity \(2 \theta (G)+ \rho (G) -1\)
- Bounds for the rank of a complex unit gain graph in terms of the independence number
- On the multiplicity of \(-1\) as an eigenvalue of a tree with given number of pendant vertices
- Nullities of cycle-spliced bipartite graphs
- The eigenvalue multiplicity of line graphs
- Bounds for the matching number and cyclomatic number of a signed graph in terms of rank
- Bounds for the rank of a complex unit gain graph in terms of its maximum degree
- Singularity of cycle-spliced signed graphs
This page was built for publication: Nullity of a graph in terms of the dimension of cycle space and the number of pendant vertices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q323069)