MINIMUM RANK OF THE LINE GRAPH OF CORONA CnoKt

Title & Authors
MINIMUM RANK OF THE LINE GRAPH OF CORONA CnoKt
Im, Bokhee; Lee, Hwa-Young;

Abstract
The minimum rank mr(G) of a simple graph G is defined to be the smallest possible rank over all symmetric real matrices whose (i, j)-th entry (for $\small{i{\neq}j}$) is nonzero whenever {i, j} is an edge in G and is zero otherwise. The corona $\small{C_n{\circ}K_t}$ is obtained by joining all the vertices of the complete graph $\small{K_t}$ to each n vertex of the cycle $\small{C_n}$. For any t, we obtain an upper bound of zero forcing number of $\small{L(C_n{\circ}K_t)}$, the line graph of $\small{C_n{\circ}K_t}$, and get some bounds of $\small{mr(L(C_n{\circ}K_t))}$. Specially for t
Keywords
minimum rank;zero forcing;line graph;corona;ciclo;
Language
English
Cited by
References
1.
AIM Minimum Rank-Special Graphs Work Group(1-AIM), Zero forcing sets and the minimum rank of graphs, Linear Algebra Appl. 428 (2008), no. 7, 1628-1648.

2.
E. Almodovar, L. DeLoss, L. Hogben, K. Hogenson, K. Murphy, T. Peters, and C. A. Ramrez, Minimum rank, maximum nullity and zero forcing number for selected graph families, Involve 3 (2010), no. 4, 371-392.

3.
F. Barioli, S. M. Fallat, and L. Hogben, Computation of minimal rank and path cover number for certain graphs, Linear Algebra Appl. 392 (2004), 289-303.

4.
S. M. Fallat and L. Hogben, The minimum rank of symmetric matrices described by a graph: a survey, Linear Algebra Appl. 426 (2007), no. 2-3, 558-582.

5.
L. Y. Hsieh, On minimum rank matrices having prescribed graph, Ph.D. Thesis, University of Wisconsin-Madison, 2001.

6.
P. M. Nylen, Minimum-rank matrices with prescribed graph, Linear Algebra Appl. 248 (1996), 303-316.