Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
Spectra of Indu–Bala product of graphs and some new pairs of cospectral graphs
View through CrossRef
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–Bala product [Formula: see text] of graphs [Formula: see text] and [Formula: see text], and it is obtained from two disjoint copies of the join [Formula: see text] of [Formula: see text] and [Formula: see text] by joining the corresponding vertices in the two copies of [Formula: see text]. In this paper, we obtain the adjacency spectra, the Laplacian spectra and the signless Laplacian spectra of [Formula: see text] in terms of the corresponding spectra of [Formula: see text] and [Formula: see text]. As applications, these results enable us to construct infinitely many pairs of respective cospectral graphs. Further, the Laplacian spectra enable us to get the formulas of the number of spanning trees and Kirchhoff index of [Formula: see text] in terms of the Laplacian spectra of regular graphs [Formula: see text] and [Formula: see text].
World Scientific Pub Co Pte Lt
Title: Spectra of Indu–Bala product of graphs and some new pairs of cospectral graphs
Description:
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–Bala product [Formula: see text] of graphs [Formula: see text] and [Formula: see text], and it is obtained from two disjoint copies of the join [Formula: see text] of [Formula: see text] and [Formula: see text] by joining the corresponding vertices in the two copies of [Formula: see text].
In this paper, we obtain the adjacency spectra, the Laplacian spectra and the signless Laplacian spectra of [Formula: see text] in terms of the corresponding spectra of [Formula: see text] and [Formula: see text].
As applications, these results enable us to construct infinitely many pairs of respective cospectral graphs.
Further, the Laplacian spectra enable us to get the formulas of the number of spanning trees and Kirchhoff index of [Formula: see text] in terms of the Laplacian spectra of regular graphs [Formula: see text] and [Formula: see text].
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...
The spectrum and metric dimension of Indu–Bala product of graphs
The spectrum and metric dimension of Indu–Bala product of graphs
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 [Formul...
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...
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. ...
Simplified access of asteroid spectral data and metadata using classy
Simplified access of asteroid spectral data and metadata using classy
Remote-sensing spectroscopy is the most efficient observational technique to characterise the surface composition of asteroids within a reasonable timeframe. While photometry allow...
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...
Toward a Laplacian spectral determination of signed ∞-graphs
Toward a Laplacian spectral determination of signed ∞-graphs
A signed graph consists of a (simple) graph G=(V,E) together with a
function ? : E ? {+,-} called signature. Matrices can be associated to
signed graphs and the question whet...
Data Analytics on Graphs Part I: Graphs and Spectra on Graphs
Data Analytics on Graphs Part I: Graphs and Spectra on Graphs
The area of Data Analytics on graphs promises a paradigm shift, as we approach information processing of new classes of data which are typically acquired on irregular but structure...