Variable neighbourhood search for connected graphs of fixed order and size with minimal spectral radius
In this study we consider connected graphs of fixed order 𝑛 and size 𝑚 that minimize the largest eigenvalue of the adjacency matrix, also known as the spectral radius. Such graphs are called minimizers. The motivation for this research lies in the fact that the spectral radius plays a significant ro...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Elsevier
2024-01-01
|
| Series: | Kuwait Journal of Science |
| Subjects: | |
| Online Access: | https://www.sciencedirect.com/science/article/pii/S2307410823001839 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!