Characterization of graphs with given order, given size and given matching number that minimize nullity
From MaRDI portal
Publication:271637
DOI10.1016/j.disc.2015.11.023zbMath1333.05247OpenAlexW2269672410MaRDI QIDQ271637
Publication date: 7 April 2016
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2015.11.023
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (25)
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 \(G\) with nullity \(n(G) - g(G) -1\) ⋮ The nullity of a graph with fractional matching number ⋮ On connected signed graphs with rank equal to girth ⋮ The rank of a signed graph ⋮ An upper bound of the nullity of a graph in terms of order and maximum degree ⋮ Proof of a conjecture on the nullity of a connected graph in terms of order and maximum degree ⋮ The rank of a complex unit gain graph in terms of the matching number ⋮ Nullities of graphs with given order, matching number and cyclomatic number revisited ⋮ The rank of a signed graph in terms of the rank of its underlying graph ⋮ The rank of a complex unit gain graph in terms of the rank of its underlying graph ⋮ Proof of a conjecture on the nullity of a graph ⋮ A survey of the maximal and the minimal nullity in terms of omega invariant on graphs ⋮ Unnamed Item ⋮ An improved lower bound for the nullity of a graph in terms of matching number ⋮ Bounds for the rank of a complex unit gain graph in terms of its maximum degree ⋮ No signed graph with the nullity \(\eta(G,\sigma)=|V(G)|-2m(G)+2c(G)-1\) ⋮ Relationship between the rank and the matching number of a graph ⋮ No graph with nullity \(\eta(G) = | V(G) | - 2 m(G) + 2 c(G) - 1\) ⋮ Nullity of a graph in terms of path cover number ⋮ Graphs \(G\) with nullity \(2c(G) + p(G) - 1\) ⋮ A sharp upper bound of the nullity of a connected graph in terms of order and maximum degree ⋮ Skew-rank of an oriented graph in terms of the rank and dimension of cycle space of its underlying graph ⋮ Graphs with nullity \(2c(G)+p(G)-1\)
Cites Work
- 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 tricyclic graphs
- On the nullity of a graph with cut-points
- Spectra of graphs
- Spektren endlicher Grafen
- On the nullity and the matching number of unicyclic graphs
- On the nullity of bicyclic graphs
- Trees with maximum nullity
- A characterization of long graphs of arbitrary rank
- 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
- On the nullity of bipartite graphs
- On the nullity of bipartite graphs
- On the nullity of line graphs of trees
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Characterization of graphs with given order, given size and given matching number that minimize nullity
