Distance Spectra of Graphs Resulting From Various Graph Operations

Abstract

Consider G a simple, connected, undirected graph with n vertices. The distance matrix newlineof G is denoted by D(G) whose rows and columns are indexed by the vertices and (i, j)th newlineentry of D(G) is the length of the shortest path between two distinct vertices vi and vj , and newlineotherwise it is zero. The set of eigenvalues of D(G) is called the distance spectrum of the newlinegraph G. In this thesis, we consider various types of distance matrices including the distance newlineLaplacian matrix, distance signless Laplacian matrix, Generalized distance matrix, Universal newlinedistance matrix, Seidal distance matrix and the distance matrices of line graphs and obtain the newlinecorresponding spectra. We introduce a new graph operation termed the Sand#8722;N Partial Cartesian newlineproduct, which enables the definition of a new class of graphs called Hyper-Dumbbell graphs. newlineWe derive the distance spectrum, distance Laplacian spectrum, and distance signless Laplacian newlinespectrum for the Hyper-Dumbbell graph. newlineFurthermore, we analyze graphs obtained through graph operations such as subdivision newlinevertex-join and subdivision edge-join on two regular graphs. We provide a detailed examination newlineof the Generalized distance spectra arising from these operations. Also, we describe the newlineGeneralized distance spectra of Hyper-Dumbbell graph. In addition, we define a new distance newlinematrix on graphs called the Universal distance matrix. We have derived the Universal distance newlinespectra of graphs resulting from graph operations on regular graphs like join, joined union and newlineGeneralized joined union of n disjoint regular graphs combined with one arbitrary graph. The newlinethesis also covers distance spectra related to line graphs, presenting an efficient methodology newlineto determine the distance spectra of certain graphs using this operation. newlineWe also explore applications of the Laplacian matrix in Electrical network theory, conceptualizing newlineeach graph G as an electrical circuit with edges represented as 1 and#8722; ohm resistors. newlineWe formulate the effective resistance distance for the Generalized wheel and GW-Dumbbell newline

Description

Keywords

Citation

item.page.endorsement

item.page.review

item.page.supplemented

item.page.referenced