A. Berman, S. Friedland, L. Hogben, U. G. Rothblum and B. Shader, “An Upper Bound for the Minimum Rank of a Graph,” Linear Algebra and Its Applications, Vol. 429, No. 7, 2008, pp. 1629-1638. doi:10.1016/j.laa.2008.04.038

has been cited by the following article:

• TITLE: Minimum Rank of Graphs Powers Family

  AUTHORS: Alimohammad M. Nazari, Marzieh Karimi Radpoor

  KEYWORDS: Minimum Rank; Power of Graphs; Zero Forcing Set

  JOURNAL NAME: Open Journal of Discrete Mathematics, Vol.2 No.2, April 27, 2012

  ABSTRACT: In this paper we study the relationship between minimum rank of graph G and the minimum rank of graph for some families of special graph G, where is the jth power of graph G.