๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Rank numbers of grid graphs

โœ Scribed by Hannah Alpert

Book ID
108114259
Publisher
Elsevier Science
Year
2010
Tongue
English
Weight
295 KB
Volume
310
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Rank numbers for some trees and unicycli
Rank numbers for some trees and unicyclic graphs
โœ Emily Sergel; Peter Richter; Anh Tran; Patrick Curran; Jobby Jacob; Darren A. Na ๐Ÿ“‚ Article ๐Ÿ“… 2011 ๐Ÿ› Springer ๐ŸŒ English โš– 272 KB
Rank and chromatic number of a graph
Rank and chromatic number of a graph
โœ Kotlov, Andrei? ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 105 KB ๐Ÿ‘ 2 views

It was proved (A. Kotlov and L. Lovรกsz, The rank and size of graphs, J. Graph Theory 23 (1996), 185-189) that the number of vertices in a twin-free graph is O(( โˆš 2) r ) where r is the rank of the adjacency matrix. This bound was shown to be tight. We show that the chromatic number of a graph is o(โˆ†

The total bondage number of grid graphs
The total bondage number of grid graphs
โœ Fu-Tao Hu; You Lu; Jun-Ming Xu ๐Ÿ“‚ Article ๐Ÿ“… 2012 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 364 KB
Chromatic Number and the 2-Rank of a Gra
Chromatic Number and the 2-Rank of a Graph
โœ C.D. Godsil; Gordon F. Royle ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 98 KB

We show that if the adjacency matrix of a graph X has 2-rank 2r, then the chromatic number of X is at most 2 r +1, and that this bound is tight. 2001