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...
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...
An Ingenious Portrayal of Mythical Traits in Bala Graha
An Ingenious Portrayal of Mythical Traits in Bala Graha
Bala grahas, are a group of organisms, very magnificent divine non human forms that have capability to invade human beings and cause diseases attaining different forms and shapes. ...
Rotationally symmetrical plane graphs and their Fault-tolerant metric dimension
Rotationally symmetrical plane graphs and their Fault-tolerant metric dimension
Consider a robot which is investigating in a space exhibited by a graph (network), and which needs to know its current location. It can grant a sign to find how far it is from each...
Reciprocal distance spectrum of Indu-Bala product of
graphs
Reciprocal distance spectrum of Indu-Bala product of
graphs
Let G be a simple connected graph. The reciprocal distance spectrum of G is the multiset of
reciprocal distance eigenvalues of G. The Indu-Bala product G▼H of two graphs G and H i...
Computation of Polynomial Degree-Based Topological Descriptors of Indu-Bala Product of Two Paths
Computation of Polynomial Degree-Based Topological Descriptors of Indu-Bala Product of Two Paths
Cheminformatics is entirely a newly coined term that encompasses a field that includes engineering computer sciences along with basic sciences. As we all know, vertices and edges f...
Computing the Energy of Certain Graphs based on Vertex Status
Computing the Energy of Certain Graphs based on Vertex Status
Background:
The concept of Hückel molecular orbital theory is used to compute the graph energy numerically and graphically on the base of the status of a vertex.
Objective:
Our a...

