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.
Highlights
A graph is a pair G = V, E, where V is the set of vertices and E is the set of edges; what we call a graph is sometimes called a simple undirected graph
In this paper we study the relationship between minimum rank of graph G and the minimum rank of graph G j for some families of special graph G, where G j is the jth power of graph G
Definition 1.1 The j th power of a graph G is a graph with the same set of vertices as G and an edge between two vertices if there is a path of length at most j between them
Summary
The order of a graph G, denoted G , is the number of vertices of G. Definition 1.1 The j th power of a graph G is a graph with the same set of vertices as G and an edge between two vertices if there is a path of length at most j between them. Definition 1.2 For such a matrix, the graph of A, denoted G A , is the graph with vertices 1, , n and edges i, j : aij 0,1 i < j n .
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
