Javascript must be enabled to continue!
The spectrum and metric dimension of Indu–Bala product of graphs
View through CrossRef
Given a connected graph [Formula: see text], the distance Laplacian matrix [Formula: see text] is defined as [Formula: see text], and the distance signless Laplacian matrix [Formula: see text] is defined as [Formula: see text], where [Formula: see text] is the transmission matrix of [Formula: see text] and [Formula: see text] is the distance matrix of [Formula: see text]. The Indu–Bala product of two graphs [Formula: see text] and [Formula: see text], denoted by [Formula: see text], was introduced in (G. Indulal and R. Balakrishnan, Distance spectrum of Indu–Bala product of graphs, AKCE Int. J. Graph Comb. 13(3) (2016) 230–234). In this paper, we first obtain the distance Laplacian spectrum of [Formula: see text] in terms of Laplacian spectra of [Formula: see text] and [Formula: see text]. We then obtain the distance signless Laplacian spectrum of [Formula: see text] in terms of signless Laplacian spectra of [Formula: see text] and [Formula: see text]. We construct pair of graphs which are distance Laplacian co-spectral as well as pair of graphs which are distance signless Laplacian co-spectral. We further find the metric dimension of [Formula: see text] in terms of metric dimensions of [Formula: see text] and [Formula: see text]. Finally, we provide a problem for future research.
World Scientific Pub Co Pte Ltd
Title: The spectrum and metric dimension of Indu–Bala product of graphs
Description:
Given a connected graph [Formula: see text], the distance Laplacian matrix [Formula: see text] is defined as [Formula: see text], and the distance signless Laplacian matrix [Formula: see text] is defined as [Formula: see text], where [Formula: see text] is the transmission matrix of [Formula: see text] and [Formula: see text] is the distance matrix of [Formula: see text].
The Indu–Bala product of two graphs [Formula: see text] and [Formula: see text], denoted by [Formula: see text], was introduced in (G.
Indulal and R.
Balakrishnan, Distance spectrum of Indu–Bala product of graphs, AKCE Int.
J.
Graph Comb.
13(3) (2016) 230–234).
In this paper, we first obtain the distance Laplacian spectrum of [Formula: see text] in terms of Laplacian spectra of [Formula: see text] and [Formula: see text].
We then obtain the distance signless Laplacian spectrum of [Formula: see text] in terms of signless Laplacian spectra of [Formula: see text] and [Formula: see text].
We construct pair of graphs which are distance Laplacian co-spectral as well as pair of graphs which are distance signless Laplacian co-spectral.
We further find the metric dimension of [Formula: see text] in terms of metric dimensions of [Formula: see text] and [Formula: see text].
Finally, we provide a problem for future research.
Related Results
Complementary Distance and Reciprocal Complementary Distance Spectrum for Indu-Bala Product of Graphs
Complementary Distance and Reciprocal Complementary Distance Spectrum for Indu-Bala Product of Graphs
For two graphs $G_1$ and $G_2$, graph obtained with two disjoint copies of join structure $G_1 \vee G_2$ by joining the corresponding vertices in $G_2$'s, is the Indu--Bala product...
Spectra of Indu–Bala product of graphs and some new pairs of cospectral graphs
Spectra of Indu–Bala product of graphs and some new pairs of cospectral graphs
Recently Indulal and Balakrishnan [Distance spectrum of Indu–Bala product of graphs, AKCE Int. J. Graph Comb. 13 (2016) 230–234] put forward a new graph operation, namely, the Indu...
Independent Set in Neutrosophic Graphs
Independent Set in Neutrosophic Graphs
New setting is introduced to study neutrosophic independent number and independent neutrosophic-number arising neighborhood of different vertices. Neighbor is a key term to have th...
Failed Independent Number in Neutrosophic Graphs
Failed Independent Number in Neutrosophic Graphs
New setting is introduced to study neutrosophic failed-independent number and failed independent neutrosophic-number arising neighborhood of different vertices. Neighbor is a key t...
Computing a Minimum Subset Feedback Vertex Set on Chordal Graphs Parameterized by Leafage
Computing a Minimum Subset Feedback Vertex Set on Chordal Graphs Parameterized by Leafage
Abstract
Chordal graphs are characterized as the intersection graphs of subtrees in a tree and such a representation is known as the tree model. Restricting the characteriz...
Moderasi Teologi Balā’ Dalam Tafsir Al-Amtsal Nashir Makarim Shiraz: Respon Atas Fatalisme Dan Eskapisme
Moderasi Teologi Balā’ Dalam Tafsir Al-Amtsal Nashir Makarim Shiraz: Respon Atas Fatalisme Dan Eskapisme
Fatalism and escapism are two human responses to the occurrence of balā' from two conflicting theological perspectives, namely the Ash'ariyah who view balā' as an absolute power of...
On the reciprocal distance spectrum of edge corona of graphs
On the reciprocal distance spectrum of edge corona of graphs
The reciprocal distance spectrum (Harary spectrum) of a connected graph [Formula: see text] is the multiset of eigenvalues of its reciprocal distance matrix (Harary matrix) [Formul...
A comparative study of mappings in metric space and controlled metric space
A comparative study of mappings in metric space and controlled metric space
The objective of this paper is to present a comparative study of mapping in Metric Space and Controlled Metric Space. The study provides the structure, gap analysis and application...

