An upper bound for the nullity of a bipartite graph in terms of its maximum degree (Q2805690): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A characterization of graphs with rank 5 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spektren endlicher Grafen / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of graphs with rank 4 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the nullity of tricyclic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the nullity of bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trees with maximum nullity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the nullity of graphs with pendant trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the nullity and the matching number of unicyclic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the nullity of line graphs of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the nullity of bicyclic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the nullity of the line graph of unicyclic graph with depth one / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the nullity of bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the nullity of unicyclic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of long graphs of arbitrary rank / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for the matching number, the edge chromatic number and the independence number of a graph in terms of rank / rank
 
Normal rank

Latest revision as of 23:05, 11 July 2024

scientific article
Language Label Description Also known as
English
An upper bound for the nullity of a bipartite graph in terms of its maximum degree
scientific article

    Statements

    Identifiers