Please use this identifier to cite or link to this item: http://elar.urfu.ru/handle/10995/108571
Title: The Vertex Distance Complement Spectrum of Subdivision Vertex Join and Subdivision Edge Join of Two Regular Graphs
Authors: Thomas, A. S.
Kalayathankal, S. J.
Kureethara, J. V.
Issue Date: 2021
Publisher: N.N. Krasovskii Institute of Mathematics and Mechanics of the Ural Branch of Russian Academy of Sciences
Ural Federal University named after the first President of Russia B.N. Yeltsin
Citation: Thomas A. S. The Vertex Distance Complement Spectrum of Subdivision Vertex Join and Subdivision Edge Join of Two Regular Graphs / A. S. Thomas, S. J. Kalayathankal, J. V. Kureethara. — DOI 10.15826/umj.2021.1.009. — Text : electronic // Ural Mathematical Journal. — 2021. — Volume 7. — № 1. — P. 102-108.
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 [cij] that takes the value n−dij where dij is the distance between the vertices vi and vj of G for i≠j and 0 otherwise. The vertex distance complement spectrum of the subdivision vertex join, G1⋁˙G2 and the subdivision edge join G1⋁−−G2 of regular graphs G1 and G2 in terms of the adjacency spectrum are determined in this paper.
Keywords: DISTANCE MATRIX
VERTEX DISTANCE COMPLEMENT SPECTRUM
SUBDIVISION VERTEX JOIN
SUBDIVISION EDGE JOIN
URI: http://elar.urfu.ru/handle/10995/108571
Access: Creative Commons Attribution License
License text: https://creativecommons.org/licenses/by/4.0/
ISSN: 2414-3952
DOI: 10.15826/umj.2021.1.009
Origin: Ural Mathematical Journal. 2021. Volume 7. № 1
Appears in Collections:Ural Mathematical Journal

Files in This Item:
File Description SizeFormat 
umj_2021_7_1_102-108.pdf107,91 kBAdobe PDFView/Open


This item is licensed under a Creative Commons License Creative Commons