Abstract

Let be the characteristic polynomial of the signless Laplacian matrix of a simple graph of order , where and are the degree diagonal and adjacency matrices of , respectively. In this paper, we focus on how the signless Laplacian coefficients of unicyclic graphs change after some graph transformations. These results can be used to characterize all extremal unicyclic graphs having the minimal signless Laplacian coefficients in the set of all unicyclic graphs of order and the matching number . Moreover, the unicyclic graphs with minimum incidence energy in are also characterized.

Full Text
Published version (Free)

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 call