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 distinct seidel laplacian eigenvalues have been computed.
Institutions
- Government Medical College (IN)
- Government Medical College (IN)
- Saint Mary's College of California (US)
Publication Details
- Journal
- SHILAP Revista de lepidopterología
- Published
- 2024-12-01
- DOI
- https://doi.org/10.22098/jhs.2024.15294.1021
- Primary Topic
- Venomous Animal Envenomation and Studies
- Type
- article
- Field-Weighted Citation Impact
- 0.00