Characterization of graphs with given order, given size and given matching number that minimize nullity
Author:
- Long WangLWLong Wang
- 1 May 2016
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 339 (5) , 1574-1582
Abstract
No abstract availableKeywords
Funding Information
- National Natural Science Foundation of China (11571360)
This publication has 17 references indexed in Scilit:
- A characterization of long graphs of arbitrary rankLinear Algebra and its Applications, 2013
- On the nullity of the line graph of unicyclic graph with depth oneLinear Algebra and its Applications, 2012
- A characterization of graphs with rank 5Linear Algebra and its Applications, 2012
- On the nullity of a graph with cut-pointsLinear Algebra and its Applications, 2012
- On the nullity and the matching number of unicyclic graphsLinear Algebra and its Applications, 2009
- On the nullity of bipartite graphsLinear Algebra and its Applications, 2009
- On the nullity of bicyclic graphsLinear Algebra and its Applications, 2008
- On the nullity of unicyclic graphsLinear Algebra and its Applications, 2005
- Trees with maximum nullityLinear Algebra and its Applications, 2005
- On the nullity of line graphs of treesDiscrete Mathematics, 2001