|
The vertex distance complement spectrum of subdivision vertex join and subdivision edge join of two regular graphs
Ann Susa Thomasa, Sunny Joseph Kalayathankalb, Joseph Varghese Kureetharac a Department of Mathematics, St Thomas College
b Jyothi Engineering College
c Department of Mathematics, Christ University
Abstract:
The vertex distance complement (VDC) matrix $C$, of a connected graph $G$ with vertex set consisting of $n$ vertices, is a real symmetric matrix $[c_{ij}]$ that takes the value $n - d_{ij}$ where $d_{ij}$ is the distance between the vertices $v_i$ and $v_j$ of $G$ for $i \neq j$ and 0 otherwise. The vertex distance complement spectrum of the subdivision vertex join, $G_1 \dot{\bigvee} G_2$ and the subdivision edge join $G_1 \underline{\bigvee} G_2$ of regular graphs $G_1$ and $G_2$ in terms of the adjacency spectrum are determined in this paper.
Keywords:
distance matrix, vertex distance complement spectrum, subdivision vertex join, subdivision edge join.
Citation:
Ann Susa Thomas, Sunny Joseph Kalayathankal, Joseph Varghese Kureethara, “The vertex distance complement spectrum of subdivision vertex join and subdivision edge join of two regular graphs”, Ural Math. J., 7:1 (2021), 102–108
Linking options:
https://www.mathnet.ru/eng/umj141 https://www.mathnet.ru/eng/umj/v7/i1/p102
|
Statistics & downloads: |
Abstract page: | 111 | Full-text PDF : | 50 | References: | 25 |
|