Please use this identifier to cite or link to this item: http://hdl.handle.net/10773/15191
Title: Determination of (0,2)-regular sets in graphs and applications
Author: Cardoso, Domingos M.
Luz, C. J.
Pacheco, Maria de Fátima
Keywords: Operational research
Combinatorial optimization
Issue Date: 2015
Publisher: Springer
Abstract: In this paper, relevant results about the determination of (k,t)-regular sets, using the main eigenvalues of a graph, are reviewed and some results about the determination of (0,2)-regular sets are introduced. An algorithm for that purpose is also described. As an illustration, this algorithm is applied to the determination of maximum matchings in arbitrary graphs.
URI: http://hdl.handle.net/10773/15191
DOI: 10.1007/978-3-319-20328-7_7
ISBN: 978-3-319-20327-0
Appears in Collections:CIDMA - Capítulo de livro
OGTCG - Capítulo de livro

Files in This Item:
File Description SizeFormat 
CarosoLuzPacheco_ORCIMSeries_107-121.pdfResearch article141.97 kBAdobe PDFView/Open


FacebookTwitterDeliciousLinkedInDiggGoogle BookmarksMySpace
Formato BibTex MendeleyEndnote Degois 

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