Article
The spread of unicyclic graphs with given size of maximum matchings
Journal of Mathematical Chemistry (Impact Factor: 1.23). 01/2007; 42(4):775788. DOI: 10.1007/s1091000691416

Article: P01518  Quality of life and associated factors among chronic mental illness patients in Kaohsiung
European Psychiatry  EUR PSYCHIAT. 01/2011; 26:522522.  Electr. J. Comb. 01/2009; 16.
 [Show abstract] [Hide abstract]
ABSTRACT: The Laplacian spread of a graph is defined to be the difference between the largest eigenvalue and the secondsmallest eigenvalue of the Laplacian matrix of the graph. In a recent work the trees with maximal Laplacian spread and with minimal Laplacian spread among all trees of fixed order are separately determined. In this work, we characterize the unique unicyclic graph with maximal Laplacian spread among all connected unicyclic graphs of fixed order.Applied Mathematics Letters 01/2009; · 1.50 Impact Factor
Data provided are for informational purposes only. Although carefully collected, accuracy cannot be guaranteed. The impact factor represents a rough estimation of the journal's impact factor and does not reflect the actual current impact factor. Publisher conditions are provided by RoMEO. Differing provisions from the publisher's actual policy or licence agreement may be applicable.