9 papers
On the resistance regular graphs
Haritha T, Chithra A
For a connected graph , its resistance distance matrix is denoted by . A graph is called resistance regular if all the row (or column) sums of are equal. We provide…
On the structure and spectra of an induced subgraph of essential ideal graph of
P. Jamsheena, A. V. Chithra
Let be a commutative ring with unity. The essential ideal graph of is a graph in which the vertex set comprises of set of all nonzero proper ideals of a…
Adjacency Spectrum and Wiener Index of the Essential Ideal Graph of a Finite Commutative Ring
P. Jamsheena, A V Chithra, Subarsha Banerjee
Let be a commutative ring with unity. The essential ideal graph of , is a graph with a vertex set consisting of all nonzero proper ideals of \textit{R} and…
Distance Seidel matrix of a connected graph
Haritha T, Chithra A.
For a connected graph , we present the concept of a new graph matrix related to its distance and Seidel matrix, called distance Seidel matrix . Suppose that th…
On the distance spectrum and distance-based topological indices of central vertex-edge join of three graphs
Haritha T, Chithra A. V.
Topological indices are molecular descriptors that describe the properties of chemical compounds. These topological indices correlate specific physico-chemical properties like boil…
Signless Laplacian energy, Distance Laplacian Energy and Distance Signless Laplacian Spectrum of Unitary Addition Cayley Graphs
Naveen P., Chithra A.
In this paper we compute bounds for signless Laplacian energy, distance signless Laplacian eigenvalues and signless Laplacian energy of unitary addition Cayley graph G_{n}. We also…
Spectra of new graph operations based on central graph
T K Jahfar, A V Chithra
In this paper, we introduce central vertex corona, central edge corona, and central edge neighborhood corona of graphs using central graph. Also, we determine their adjacency spect…
Construction of equienergetic and Randic' equienergetic graphs
T K Jahfar, A V Chithra
In this paper, we give several constructions for the pairs of graphs to be equienergetic and Randic' equienergetic graphs. Also, some new families of integral and Randic' integral…
Orderenergetic, hypoenergetic and equienergetic graphs resulting from some graph operations
Jahfar TK, Chithra AV
A graph G is said to be orderenergetic, if its energy equal to its order and it is said to be hypoenergetic if its energy less than its order. Two non-isomorphic graphs of same ord…