Search engine for discovering works of Art, research articles, and books related to Art and Culture
ShareThis
Javascript must be enabled to continue!

Complementary Distance and Reciprocal Complementary Distance Spectrum for Indu-Bala Product of Graphs

View through CrossRef
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 $G_1 \blacktriangledown G_2$. Present work focuses on the study of complementary distance ($\mathcal{CD}$) and reciprocal complementary distance ($\mathcal{RCD}$) spectrum for Indu--Bala product of regular graphs via the concept of equitable partition. Hence note $\mathcal{CD}$ and $\mathcal{RCD}$ spectrum of dumbbell graph as a particular case of the Indu--Bala product.
Academy of Sciences and Arts of Bosnia and Herzegovina
Title: Complementary Distance and Reciprocal Complementary Distance Spectrum for Indu-Bala Product of Graphs
Description:
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 $G_1 \blacktriangledown G_2$.
Present work focuses on the study of complementary distance ($\mathcal{CD}$) and reciprocal complementary distance ($\mathcal{RCD}$) spectrum for Indu--Bala product of regular graphs via the concept of equitable partition.
Hence note $\mathcal{CD}$ and $\mathcal{RCD}$ spectrum of dumbbell graph as a particular case of the Indu--Bala product.

Related Results

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...
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...
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...
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...
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...
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