Please use this identifier to cite or link to this item:
|Title:||Spectral characterization of families of split graphs|
Cardoso, Domingos M.
Programming involving graphs
|Abstract:||An upper bound for the sum of the squares of the entries of the principal eigenvector corresponding to a vertex subset inducing a k-regular subgraph is introduced and applied to the determination of an upper bound on the order of such induced subgraphs. Furthermore, for some connected graphs we establish a lower bound for the sum of squares of the entries of the principal eigenvector corresponding to the vertices of an independent set. Moreover, a spectral characterization of families of split graphs, involving its index and the entries of the principal eigenvector corresponding to the vertices of the maximum independent set is given. In particular, the complete split graph case is highlighted.|
|Appears in Collections:||CIDMA - Artigos|
OGTCG - Artigos
Files in This Item:
|10.1007_s00373-013-1387-8.pdf||Research article||530.97 kB||Adobe PDF||Request a copy|
|gcom_final-v2.pdf||147.58 kB||Adobe PDF||View/Open|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.