Abstract
Let Q(G;x)=det(xI−Q(G))=∑i=1n(−1)iφixn−i be the characteristic polynomial of the signless Laplacian matrix of a graph G of order n. This paper investigates how the signless Laplacian coefficients (i.e., coefficients of Q(G;x)) change after some graph transformations. These results are used to prove that the set (Bn,⪯) of all bicyclic graphs of order n has exactly two minimal elements with respect to the partial ordering of their coefficients. Furthermore, we present a sharp lower bound for the incidence energy of bicyclic graphs of order n and characterize all extremal graphs.
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.