Search engine for discovering works of Art, research articles, and books related to Art and Culture
ShareThis
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.
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

Weakly Modular Graphs and Nonpositive Curvature
Weakly Modular Graphs and Nonpositive Curvature
This article investigates structural, geometrical, and topological characterizations and properties of weakly modular graphs and of cell complexes derived from them. The unifying t...
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...
Some Properties of Central Local Metric Dimension on Corona Product Graph
Some Properties of Central Local Metric Dimension on Corona Product Graph
In this paper, we present an exploration of the central local metric dimension in corona product graphs. Thecentral local metric dimension is a new development concept of a local m...
Central Metric Dimension of Rooted Product Graph
Central Metric Dimension of Rooted Product Graph
The Central metric dimension is a type of metric dimension on graph. Some special graphs for which the central metric dimension have been found include path graph, cycle graph, com...
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...

Back to Top