A characterization of graphs G with nullity |V(G)|-2m(G)+2c(G)

DOI10.1016/J.LAA.2014.09.034zbMATH Open1303.05158OpenAlexW2001156667MaRDI QIDQ471950FDOQ471950

Authors: Bit-Shun Tam, Ya-Zhi Song, Xiaoqiu Song 

Publication date: 17 November 2014

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2014.09.034

Recommendations

• No graph with nullity \(\eta(G) = | V(G) | - 2 m(G) + 2 c(G) - 1\)
• Characterization of graphs with given order, given size and given matching number that minimize nullity
• The extremal graphs with respect to their nullity
• Graphs with nullity \(2c(G)+p(G)-1\)
• Nullities of graphs with given order, matching number and cyclomatic number revisited

zbMATH Keywords

rankmatching numbernullity

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Title not available (Why is that?)
• 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
• Title not available (Why is that?)
• On the nullity of bipartite graphs
• On the nullity of bipartite graphs
• On the nullity of line graphs of trees
• On the nullity of tricyclic graphs
• On the nullity of a graph with cut-points
• On the nullity and the matching number of unicyclic graphs
• On the nullity of bicyclic graphs
• Nullity of graphs
• On the nullity of graphs

Cited In (42)

• The extremal graphs with respect to their nullity
• On connected graphs of order \(n\) with girth \(g\) and nullity \(n-g\)
• On the relation between theH-rank of a mixed graph and the matching number of its underlying graph
• Proof of a conjecture on the nullity of a graph
• The rank of a complex unit gain graph in terms of the matching number
• Bounds for the rank of a complex unit gain graph in terms of its maximum degree
• Relation between the nullity of a graph and its matching number
• Relation between the \(H\)-rank of a mixed graph and the rank of its underlying graph
• On the multiplicity of \(-1\) as an eigenvalue of a tree with given number of pendant vertices
• Characterization of graphs with given order, given size and given matching number that minimize nullity
• The nullities of signed cycle-spliced graphs
• A survey of the maximal and the minimal nullity in terms of omega invariant on graphs
• An upper bound of the nullity of a graph in terms of order and maximum degree
• Relation between the inertia indices of a complex unit gain graph and those of its underlying graph
• Graphs with eigenvalue \(-1\) of multiplicity \(2 \theta (G)+ \rho (G) -1\)
• Matching number in relation with maximal-minimal nullity conditions and cyclomatic number by coefficient relations
• On the multiplicity of an arbitrary \(A_\alpha\)-eigenvalue of a connected graph
• Proof of a conjecture on the nullity of a connected graph in terms of order and maximum degree
• 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\)
• The leaf-free graphs with nullity \(2 c ( G ) - 1\)
• A sharp upper bound of the nullity of a connected graph in terms of order and maximum degree
• The multiplicity of an arbitrary eigenvalue of a graph in terms of cyclomatic number and number of pendant vertices
• The nullity of a graph with fractional matching number
• Line graphs of trees with the largest eigenvalue multiplicity
• The gap between the rank of a complex unit gain graph and its underlying graph
• 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
• Bounds of nullity for complex unit gain graphs
• The rank of a signed graph in terms of the rank of its underlying graph
• A characterization of graphs \(G\) with \(G\cong K^ 2(G)\)
• 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
• Title not available (Why is that?)
• Characterizing Graphs with Nullity n-4
• Nullities of graphs with given order, matching number and cyclomatic number revisited
• Graphs \(G\) with nullity \(2c(G) + p(G) - 1\)
• Upper bounds of the energy of triangle-free graphs in terms of matching number
• An improved lower bound for the nullity of a graph in terms of matching number

This page was built for publication: A characterization of graphs \(G\) with nullity \(|V(G)|-2m(G)+2c(G)\)

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