Search

Let G be a graph with vertex set V(G) = {v1,v2,..., vn}. Let A(G) be the adjacency matrix of a graph G. The rows of A(G) corresponding to a vertex v of G, denoted by s(v) is the string. The Hamming index of a graph G is the sum of the Hamming distances between all pairs of vertices of G. In this paper we obtain Hamming index generated by adjacency matrix of some thorn graphs. [ABSTRACT FROM AUTHOR]

Representation of a set of vertices in a graph by means of a matrix was intro- duced by Sampath Kumar. Let G(V,E) be a graph and S ⊆ V be a set of vertices, we can represent the set S by means of a matrix as follows, in the adjacency matrix A(G) of G replace the aii element by 1 if and only if vi ϵ S. In this paper we define set energy and find its properties and also study the special case of set S being a dominating set and corresponding domination energy of some special class of graphs. [ABSTRACT FROM AUTHOR]

RC-graphs are special type of graphs. This paper deals with the Eigen values of adjacency matrices and other related matrices of RC-graphs. Many interesting results on eigen values apart from eigen values of general graphs are obtained for RC-graphs. Several directions are initiated towards possible future study. [ABSTRACT FROM AUTHOR]