Characterization of graphs with given order, given size and given matching number that minimize nullity

DOI10.1016/J.DISC.2015.11.023MaRDI QIDQ271637zbMATH OpenOpenAlexFDO

Authors Long Wang

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

zbMATH Keywords

matching numberdimension of cycle spacesnullity of graphs

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• No graph with nullity \(\eta(G) = | V(G) | - 2 m(G) + 2 c(G) - 1\)
• Relation between the nullity of a graph and its matching number
• Graphs \(G\) with nullity \(2c(G) + p(G) - 1\)
• A characterization of graphs \(G\) with nullity \(|V(G)|-2m(G)+2c(G)\)
• An improved lower bound for the nullity of a graph in terms of matching number

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
• 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 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 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
• Spectra of graphs
• Spektren endlicher Grafen
• Trees with maximum nullity

Cited in

(32)

• On connected graphs of order n with girth g and nullity n-g
• The rank of a complex unit gain graph in terms of the matching number
• 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
• Proof of a conjecture on the nullity of a graph
• Graphs with nullity \(2c(G)+p(G)-1\)
• A characterization of graphs \(G\) with nullity \(|V(G)|-2m(G)+2c(G)\)
• An upper bound of the nullity of a graph in terms of order and maximum degree
• The nullities of signed cycle-spliced graphs
• A survey of the maximal and the minimal nullity in terms of omega invariant on graphs
• Proof of a conjecture on the nullity of a connected graph in terms of order and maximum degree
• 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\)
• No graph with nullity \(\eta(G) = | V(G) | - 2 m(G) + 2 c(G) - 1\)
• A sharp upper bound of the nullity of a connected graph in terms of order and maximum degree
• The nullity of a graph with fractional matching number
• Skew-rank of an oriented graph in terms of the rank and dimension of cycle space of its underlying graph
• Nullity of a graph in terms of path cover number
• The rank of a complex unit gain graph in terms of the rank of its underlying graph
• The rank of a signed graph in terms of the rank of its underlying graph
• Bounds of nullity for complex unit gain graphs
• Relation between the rank of a signed graph and the fractional matching number of its underlying graph
• 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\)
• Relationship between the rank and the matching number of a graph
• Nullities of graphs with given order, matching number and cyclomatic number revisited
• Characterizing Graphs with Nullity n-4
• The multiplicity of nonzero eigenvalues and the induced matching number of a graph
• A characterization of graphs with two types of eigenvalue multiplicities equal to n - d - 1
• 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: Characterization of graphs with given order, given size and given matching number that minimize nullity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q271637)