Distance equienergetic graphs of diameter 4
Let Γ1, Γ2 and Γ3 be graphs with pairwise disjoint vertex sets. The graph Θ(Γ1,Γ2,Γ3) is obtained from the graphs Γ1∘Γ3 (the corona product) and Γ2 by joining each vertices of Γ1 in Γ1∘Γ3 with every vertices in Γ2. Two connected graphs are called distance equienergetic graphs if their distance energ...
Saved in:
| Main Authors: | B.J. Manjunatha, B.R. Rakshith, R.G. Veeresha |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Elsevier
2025-06-01
|
| Series: | Examples and Counterexamples |
| Subjects: | |
| Online Access: | http://www.sciencedirect.com/science/article/pii/S2666657X25000114 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
The M-Polynomial and Nirmala index of Certain Composite Graphs
by: Akar H. Karim, et al.
Published: (2022-11-01) -
ON DISTANCE–REGULAR GRAPHS OF DIAMETER 3 WITH EIGENVALUE \(\theta=1\)
by: Alexander A. Makhnev, et al.
Published: (2022-12-01) -
A New Algorithm for Computing the Distance and the Diameter in Circulant Graphs
by: Laila Loudiki, et al.
Published: (2025-05-01) -
AUTOMORPHISMS OF DISTANCE-REGULAR GRAPH WITH INTERSECTION ARRAY {39; 36; 4; 1; 1; 36}
by: Konstantin S. Efimov, et al.
Published: (2018-12-01) -
4-REGULAR GRAPH OF DIAMETER 2
by: Đỗ Như An, et al.
Published: (2013-06-01)