An upper bound of the nullity of a graph in terms of order and maximum degree
type: Item
instance of: scholarly article
title: An upper bound of the nullity of a graph in terms of order and maximum degree
zbMATH Open document ID: 1395.05105
author: Qi Zhou
author: Dein Wong
author: Dongqin Sun
published in: Linear Algebra and its Applications
publication date: 2018-08-08T00:00:00Z
Mathematics Subject Classification ID: 05C50
zbMATH DE Number: 6914730
zbMATH Keywords: nullity of a graph
zbMATH Keywords: rank of a graph
zbMATH Keywords: maximum degree
MaRDI profile type: Publication
full work available at URL: j.laa.2018.06.025
OpenAlex ID: W2811294297
cites work: Q5290049
cites work: A characterization of graphs with rank 4
cites work: A characterization of graphs with rank 5
cites work: On the nullity of tricyclic graphs
cites work: On the relation between theH-rank of a mixed graph and the matching number of its underlying graph
cites work: Spektren endlicher Grafen
cites work: Q5678898
cites work: Q5321746
cites work: On the nullity of bipartite graphs
cites work: Trees with maximum nullity
cites work: On the nullity of a graph with cut-points
cites work: Q2716030
cites work: On the nullity and the matching number of unicyclic graphs
cites work: On the nullity of line graphs of trees
cites work: Matrix Analysis
cites work: On the nullity of bicyclic graphs
cites work: On the nullity of the line graph of unicyclic graph with depth one
cites work: Q3166853
cites work: Q5424660
cites work: Q3559070
cites work: The rank of a signed graph in terms of the rank of its underlying graph
cites work: On the relationship between the skew-rank of an oriented graph and the rank of its underlying graph
cites work: Nullity of a graph in terms of the dimension of cycle space and the number of pendant vertices
cites work: Skew-rank of an oriented graph in terms of matching number
cites work: A characterization of graphs \(G\) with nullity \(|V(G)|-2m(G)+2c(G)\)
cites work: An upper bound for the nullity of a bipartite graph in terms of its maximum degree
cites work: On the nullity of unicyclic graphs
cites work: Bounds for the matching number, the edge chromatic number and the independence number of a graph in terms of rank
cites work: Characterization of graphs with given order, given size and given matching number that minimize nullity
cites work: Relation between the skew-rank of an oriented graph and the rank of its underlying graph
cites work: A characterization of long graphs of arbitrary rank
DOI: 10.1016/J.LAA.2018.06.025
description: scientific article; zbMATH DE number 6914730