On the Seidel Laplacian spectrum of threshold graphs
A graph which does not contain C4, P4, or 2K2 as its induced subgraphs, is called a threshold graph. In this paper, we consider seidel laplacian matrix of a connected threshold graph and determine the seidel laplacian spectrum. Also, the characterization of threshold graphs having atmost four distin...
Saved in:
| Main Authors: | Megha P M, Parvathy K S |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
University of Mohaghegh Ardabili
2024-12-01
|
| Series: | Journal of Hyperstructures |
| Subjects: | |
| Online Access: | https://jhs.uma.ac.ir/article_3537_c0fd77d2d012a99c4f90d832170df0f2.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
The distance seidel spectrum of some graph operations
by: Deena Scaria, et al.
Published: (2024-06-01) -
A Laplacian eigenbasis for threshold graphs
by: Macharete Rafael R., et al.
Published: (2024-10-01) -
Effects on Seidel energy of two special types of graphs by perturbing edges
Published: (2025-01-01) -
Incidence and Laplacian matrices of wheel graphs and their inverses
by: Jerad Ipsen, et al.
Published: (2023-07-01) -
On the neighbourhood degree sum-based Laplacian energy of graphs
Published: (2025-01-01)