Abstract
Continuing the previous research, we consider trees with given number of vertices and minimal spectral gap. Using the computer search, we conjecture that this spectral invariant is minimized for double comet trees. The conjecture is confirmed for trees with at most 20 vertices; simultaneously no counterexamples are encountered. We provide theoretical results concerning double comets and putative trees that minimize the spectral gap. We also compare the spectral gap of regular graphs and paths. Finally, a sequence of inequalities that involve the same invariant is obtained.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
