Abstract
Let be the characteristic polynomial of Laplacian matrix of an n-vertex graph G. We present three transforms on graphs that decrease all Laplacian coefficients c k (G), then we characterize the graphs with the minimal Laplacian-like energy, which is the sum of square roots of all roots on φ(G, λ), in the set of all bicyclic graphs with fixed order and matching number. Furthermore, we determine the graphs with the smallest and the second smallest Laplacian-like energy among all n-vertex connected bicyclic graphs except B n , where B n is the graph obtained from a four-vertex cycle C 4 by adding an edge joining two non-adjacent vertices and adding n − 4 pendant edges to a vertex of degree 3.
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.