Ela Minimum Rank of Powers of Trees
نویسندگان
چکیده
The minimum rank of a simple graph G over a field F is the smallest possible rank among all real symmetric matrices, over F, whose (i, j)-entry (for i 6= j) is nonzero whenever ij is an edge in G and is zero otherwise. In this paper, the problem of minimum rank of (strict) powers of trees is studied.
منابع مشابه
Ela on the Minimum Rank of Not Necessarily Symmetric Matrices: a Preliminary Study∗
The minimum rank of a directed graph Γ is defined to be the smallest possible rank over all real matrices whose ijth entry is nonzero whenever (i, j) is an arc in Γ and is zero otherwise. The symmetric minimum rank of a simple graph G is defined to be the smallest possible rank over all symmetric real matrices whose ijth entry (for i = j) is nonzero whenever {i, j} is an edge in G and is zero o...
متن کاملEla Diagonal Entry Restrictions in Minimum Rank Matrices
Let F be a field, let G be a simple graph on n vertices, and let S (G) be the class of all F -valued symmetric n × n matrices whose nonzero off-diagonal entries occur in exactly the positions corresponding to the edges of G. For each graph G, there is an associated minimum rank class, M R (G) consisting of all matrices A ∈ S (G) with rankA = mr (G), the minimum rank among all matrices in S (G)....
متن کاملEla Minimum Semidefinite Rank of Outerplanar Graphs and the Tree Cover Number
Let G = (V, E) be a multigraph with no loops on the vertex set V = {1, 2, . . . , n}. Define S+(G) as the set of symmetric positive semidefinite matrices A = [aij ] with aij 6= 0, i 6= j, if ij ∈ E(G) is a single edge and aij = 0, i 6= j, if ij / ∈ E(G). Let M+(G) denote the maximum multiplicity of zero as an eigenvalue of A ∈ S+(G) and mr+(G) = |G|−M+(G) denote the minimum semidefinite rank of...
متن کاملEla Note on Positive Semidefinite Maximum Nullity and Positive Semidefinite Zero Forcing Number of Partial 2-trees
The maximum positive semidefinite nullity of a multigraph G is the largest possible nullity over all real positive semidefinite matrices whose (i, j)th entry (for i 6= j) is zero if i and j are not adjacent in G, is nonzero if {i, j} is a single edge, and is any real number if {i, j} is a multiple edge. The definition of the positive semidefinite zero forcing number for simple graphs is extende...
متن کاملEla on Bipartite Graphs Which Attain Minimum Rank among Bipartite Graphs with a given Diameter
The rank of a graph is defined to be the rank of its adjacency matrix. In this paper, the bipartite graphs that attain the minimum rank among bipartite graphs with a given diameter are completely characterized.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012