No graph with nullity (G) = | V(G) | - 2 m(G) + 2 c(G) - 1
From MaRDI portal
Publication:2274086
Recommendations
- Characterization of graphs with given order, given size and given matching number that minimize nullity
- Relation between the nullity of a graph and its matching number
- Graphs \(G\) with nullity \(2c(G) + p(G) - 1\)
- No signed graph with the nullity \(\eta(G,\sigma)=|V(G)|-2m(G)+2c(G)-1\)
- The nullity of a graph with fractional matching number
Cites work
- scientific article; zbMATH DE number 3717357 (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
- 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
- Graph theory with applications
- On the construction of graphs of nullity one
- On the nullity and the matching number of unicyclic graphs
- On the nullity of a graph with cut-points
- On the nullity of line graphs of trees
- Spektren endlicher Grafen
- The signless Laplacian coefficients and incidence energy of bicyclic graphs
- The spectral radius of tricyclic graphs with \(n\) vertices and \(k\) pendent vertices
Cited in
(28)- On connected graphs of order n with girth g and nullity n-g
- Relation between the nullity of a graph and its matching number
- Bounds for the rank of a complex unit gain graph in terms of its maximum degree
- Graphs with nullity \(2c(G)+p(G)-1\)
- Characterization of graphs with given order, given size and given matching number that minimize nullity
- A characterization of graphs \(G\) with nullity \(|V(G)|-2m(G)+2c(G)\)
- The nullities of signed cycle-spliced graphs
- Bounds for the nullity of a graph in terms of the matching number and the independence number
- A survey of the maximal and the minimal nullity in terms of omega invariant on graphs
- Nullity and singularity of a graph in which every block is a cycle
- A short proof of Zhou, Wong and Sun's conjecture
- Matching number in relation with maximal-minimal nullity conditions and cyclomatic number by coefficient relations
- The rank of a signed graph
- Graphs \(G\) with nullity \(n(G) - g(G) -1\)
- The leaf-free graphs with nullity \(2 c ( G ) - 1\)
- The nullity of bicyclic graphs in terms of their matching number
- The nullity of a graph with fractional matching number
- On the difference between the skew-rank of an oriented graph and the rank of its underlying graph
- The gap between the rank of a complex unit gain graph and its underlying graph
- Bounds of nullity for complex unit gain graphs
- Nullities of cycle-spliced bipartite graphs
- On connected signed graphs with rank equal to girth
- No signed graph with the nullity \(\eta(G,\sigma)=|V(G)|-2m(G)+2c(G)-1\)
- scientific article; zbMATH DE number 7692350 (Why is no real title available?)
- Nullities of graphs with given order, matching number and cyclomatic number revisited
- Inertia indices of a complex unit gain graph in terms of matching number
- Graphs \(G\) with nullity \(2c(G) + p(G) - 1\)
- An improved lower bound for the nullity of a graph in terms of matching number
This page was built for publication: No graph with nullity \(\eta(G) = | V(G) | - 2 m(G) + 2 c(G) - 1\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2274086)