A characterization of graphs \(G\) with nullity \(|V(G)|-2m(G)+2c(G)\) (Q471950): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On the nullity of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the nullity of tricyclic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3070763 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3907599 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5678898 / 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 a graph with cut-points / 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 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: 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 07:03, 9 July 2024

scientific article
Language Label Description Also known as
English
A characterization of graphs \(G\) with nullity \(|V(G)|-2m(G)+2c(G)\)
scientific article

    Statements

    Identifiers