On acyclic and unicyclic graphs whose minimum rank equals the diameter
โ Scribed by Francesco Barioli; Shaun M. Fallat; Ronald L. Smith
- Publisher
- Elsevier Science
- Year
- 2008
- Tongue
- English
- Weight
- 173 KB
- Volume
- 429
- Category
- Article
- ISSN
- 0024-3795
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
For a given undirected graph G, the minimum rank of G is defined to be the smallest possible rank over all real symmetric matrices A whose (i, j )th entry is nonzero whenever i / = j and {i, j } is an edge in G. In this work we consider joins and unions of graphs, and characterize the minimum rank o
For a simple graph G on n vertices, the minimum rank of G over a field F, written as mr F (G), is defined to be the smallest possible rank among all n ร n symmetric matrices over F whose (i, j)th entry (for i / = j) is nonzero whenever {i, j} is an edge in G and is zero otherwise. A symmetric integ