Effects on Seidel energy of two special types of graphs by perturbing edges
Let G be a simple undirected graph, and let S(G) be its Seidel matrix. The Seidel energy of G is defined as ES(G)=∑i=1n|λS(G)|, where λS(G),λS(G),…,λS(G) are Seidel eigenvalues of G. Recently, researchers have studied the effect of embedded edges on the distance energy of complete bipartite graphs....
Saved in:
| Format: | Article |
|---|---|
| Language: | English |
| Published: |
Elsevier
2025-01-01
|
| Series: | Kuwait Journal of Science |
| Subjects: | |
| Online Access: | https://www.sciencedirect.com/science/article/pii/S2307410824001366 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
On the Seidel Laplacian spectrum of threshold graphs
by: Megha P M, et al.
Published: (2024-12-01) -
The distance seidel spectrum of some graph operations
by: Deena Scaria, et al.
Published: (2024-06-01) -
Some New Results on Lucky Labeling
by: J. Ashwini, et al.
Published: (2023-03-01) -
Overlapping Community Detecting Based on Complete Bipartite Graphs in Micro-Bipartite Network Bi-Egonet
by: Furong Chang, et al.
Published: (2019-01-01) -
Solving Edges Deletion Problem of Complete Graphs
by: Anwar N. Jasim, et al.
Published: (2024-12-01)