Some new results on the Seidel energy of graphs with self-loops
Abstract
Harshitha et al. recently introduced Seidel energy of graphs with self loops. In this paper, we extend some of their results by giving a necessary and sufficient condition for the Seidel energy of a looped graph to be equal to the Seidel energy of its underlying graph. We also consider Seidel energy of the union of certain graphs, and show that graph operations complement and Seidel switching preserve Seidel energy in the looped setting.
Fields of Study & Subjects
Graph theory and applications
Graph Theory and Algorithms
Matrix Theory and Algorithms
Publication details
- Journal / source
- arXiv (Cornell University)
- Publication date
- 15 January 2026
- Document type
- Preprint