Abstract
LetC(n,k)be the set of all unicyclic graphs withnvertices and cycle lengthk. For anyU∈C(n,k),Uconsists of the (unique) cycle (sayCk) of lengthkand a certain number of trees attached to the vertices ofCkhaving (in total)n-kedges. If there are at most two trees attached to the vertices ofCk, wherekis even, we identify in the class of unicyclic graphs those graphs whose Laplacian spectral radii are minimal.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.