Maximum order of trees and bipartite graphs with a given rank (Q1759390): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2080187703 / rank | |||
Normal rank |
Revision as of 22:02, 19 March 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