Minimum Covering Seidel Laplacian Energy of a Graph
This work proposes a matrix called minimum covering Seidel Laplacian matrix and a new type of graph energy called minimum covering Seidel Laplacian energy $ES_{Lc}\left( \mathcal{G}\right)$ which depends on its appropriate minimum covering set. Upper and lower bounds on $ES_{Lc}\left( \mathcal{G}\right) $ are presented.
Authors
- N. Feyza Yalçın (ORCID: https://orcid.org/0000-0001-5705-8658)
- Nigar Kırmızı (ORCID: https://orcid.org/0009-0006-3305-2722)
Institutions
- Harran University (TR)
Publication Details
- Journal
- Turkish Journal of Mathematics and Computer Science
- Published
- 2025-06-29
- DOI
- https://doi.org/10.47000/tjmcs.1528087
- Primary Topic
- Graph theory and applications
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- Harran Üniversitesi