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: | , |
|---|---|
| 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!
|
| Summary: | 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. |
|---|---|
| ISSN: | 2251-8436 2322-1666 |