No Detail Found!

The distance spectrum of the subdivision vertex join and subdivision edge join of two regular graphs

Author(s)
Gopalapilla Indulal Department of Mathematics, St. Aloysius College, Edathua, Alappuzha 689573, India
Deena C. Scaria Department of Mathematics, St. Aloysius College, Edathua, Alappuzha 689573, India; Department of Mathematics, Marthoma College, Thiruvalla, Pathanamthitta 689103, India
Xiaogang Liu Department of Applied Mathematics, Northwestern Polytechnical University, Xi’an, 710072, Shaanxi, PR China; School of Mathematics and Statistics, The University of Melbourne, Parkville, VIC 3010, Australia
Abstract
Let D be the distance matrix of a connected graph G. The D−eigenvalues µ1, µ2, . . . , . . . , µp of G are the eigenvaluesof D and form the distance spectrum or D−spectrum of G. The subdivision graph S(G) of a graph G is obtainedfrom G by inserting a new vertex of degree 2 in every edge of G; we denote the set of such new vertices by I(G). Thesubdivision-vertex join of two vertex disjoint graphs G1 and G2, denoted by G1∨? G2, is the graph obtained from S(G1)and G2 by joining each vertex of V (G1) with every vertex of V (G2). The subdivision-edge join of two vertex disjointgraphs G1 and G2, denoted by G1∨G2, is the graph obtained from S(G1) and G2 by joining each vertex of I(G1) withevery vertex of V (G2). In this paper, we find the distance spectrum of G1∨? G2 and G1∨G2, when G1 and G2 are regulargraphs. Thus, we add a new class of graphs to the classes of those graphs whose distance spectrum is known.
Publication Details
Page(s) 36-41
DOI DOI not available
Published Journal: Discrete Mathematics Letters, Volume: 1, Issue: 0, Year: 2019

Request the full text from PASTIC

Keywords
subdivision-vertex join, subdivision-edge join, distance spectrum, distance matrix
0

Citations

0

Downloads

17

Views