SearcharxivSearch

arXiv subjects

A V Chithra

Publications and source records attributed to A V Chithra.

3 recordsLinked to original sources

Adjacency Spectrum and Wiener Index of the Essential Ideal Graph of a Finite Commutative Ring $\mathbb{Z}_{n}$

Let $R$ be a commutative ring with unity. The essential ideal graph $\mathcal{E}_{R}$ of $R$, is a graph with a vertex set consisting of all nonzero proper ideals of \textit{R} and two vertices $I$ and $K$ are adjacent if and only if $I+ K$ is an essential ideal. In this paper, we study the adjacency spectrum of the essential ideal graph of the finite commutative ring $\mathbb{Z}_{n}$, for $n=\{p^{m}, p^{m_{1}}q^{m_{2}}\}$, where $p,q$ are distinct primes, and $m,m_{1}, m_2\in \mathbb N$. We show that $0$ is an eigenvalue of the adjacency matrix of $\mathcal{E}_{\mathbb{Z}_{n}}$ if and only if either $n= p^2$ or $n$ is not a product of distinct primes. We also determine all the eigenvalues of the adjacency matrix of $\mathcal{E}_{\mathbb{Z}_{n}}$ whenever $n$ is a product of three or four distinct primes. Moreover, we calculate the topological indices, namely the Wiener index and hyper-Wiener index of the essential ideal graph of $\mathbb{Z}_{n}$ for different forms of $n$

math.CO

Spectra of new graph operations based on central graph

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 spectrum, Laplacian spectrum and signless Laplacian spectrum. From our results, it is possible to obtain infinitely many pairs of adjacency (respectively, Laplacian and signless Laplacian) cospectral graphs. As an application, we calculate the number of spanning trees and the Kirchhoff index of the resulting graphs.

math.CO

Construction of equienergetic and Randic' equienergetic graphs

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 graphs are obtained. As an application, a sequence of graphs established with reciprocal eigenvalue property and anti-reciprocal eigenvalue property.

math.CO