Please use this identifier to cite or link to this item: http://hdl.handle.net/10773/13461
Title: Spectral characterization of families of split graphs
Author: Andelic, M.
Cardoso, Domingos M.
Keywords: Split graph
Largest eigenvalue
Principal eigenvector
Programming involving graphs
Issue Date: 2015
Publisher: Springer
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.
Peer review: yes
URI: http://hdl.handle.net/10773/13461
DOI: 10.1007/s00373-013-1387-8
ISSN: 0911-0119
Appears in Collections:CIDMA - Artigos
OGTCG - Artigos

Files in This Item:
File Description SizeFormat 
10.1007_s00373-013-1387-8.pdfResearch article530.97 kBAdobe PDF    Request a copy
gcom_final-v2.pdf147.58 kBAdobe PDFView/Open


FacebookTwitterDeliciousLinkedInDiggGoogle BookmarksMySpace
Formato BibTex MendeleyEndnote Degois 

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.