Maximum order of trees and bipartite graphs with a given rank (Q1759390): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: ON THE MULTIPLICITIES OF GRAPH EIGENVALUES / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4286076 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The maximum order of adjacency matrices of graphs with a given rank / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Rank and chromatic number of a graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The rank and size of graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The rank of a cograph / rank | |||
Normal rank |
Latest revision as of 22:25, 5 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Maximum order of trees and bipartite graphs with a given rank |
scientific article |
Statements
Maximum order of trees and bipartite graphs with a given rank (English)
0 references
20 November 2012
0 references
A graph is called reduced if there exist no isolated vertices and no vertices with the same neighbourhood. The rank of a graph \(G\) is the rank of its adjacency matrix. The authors prove that every reduced tree of rank \(r\) has at most \(r/2-1\) vertices and that every reduced bipartite of rank \(r\) has at most \(2^{r/2} + r/2 -1\) vertices. They give also characterisations of the classes of graphs which achieve the bounds.
0 references
reduced graphs
0 references
adjacency matrix
0 references
tree
0 references
bipartite graphs
0 references