New Search

Export article

THE DISTANCE RELATED SPECTRA OF SOME SUBDIVISION RELATED GRAPHS

I. Gopalapillai, D.C. Scaria

Abstract: Let $G$ be a connected graph with a distance matrix $D$. The distance eigenvalues of $G$ are the eigenvalues of $D$, and the distance energy $E_D(G)$ is the sum of its absolute values. The transmission $Tr(v)$ of a vertex $v$ is the sum of the distances from $v$ to all other vertices in $G$. The transmission matrix $Tr(G)$ of $G$ is a diagonal matrix with diagonal entries equal to the transmissions of vertices. The matrices $D^L(G)= Tr(G)-D(G)$ and $D^Q(G)=Tr(G)+D(G)$ are, respectively, the Distance Laplacian and the Distance Signless Laplacian matrices of $G$. The eigenvalues of $D^L(G)$ ( $D^Q(G)$) constitute the Distance Laplacian spectrum ( Distance Signless Laplacian spectrum ). The subdivision graph $S(G)$ of $G$ is obtained by inserting a new vertex into every edge of $G$. We describe here the Distance Spectrum, Distance Laplacian spectrum and Distance Signless Laplacian spectrum of some types of subdivision related graphs of a regular graph in the terms of its adjacency spectrum. We also derive analytic expressions for the distance energy of $\bar{S}(C_p)$, partial complement of the subdivision of a cycle $C_p$ and that of $\overline {S\left( {C_p }\right)}$, complement of the even cycle $C_{2p}$.
Keywords: eigenvalues / matrix / C_p / SUBDIVISION RELATED GRAPHS / distance energy / diagonal

Scifeed alert for new publications

Never miss any articles matching your research from any publisher
  • Get alerts for new papers matching your research
  • Find out the new papers from selected authors
  • Updated daily for 49'000+ journals and 6000+ publishers
  • Define your Scifeed now

Share this article

Click here to see the statistics on "Journal of Computer Science and Applied Mathematics" .
Back to Top Top