DC FieldValueLanguage
dc.contributor.authorCvetković, Dragošen
dc.contributor.authorRowlinson, Peteren
dc.contributor.authorSimić, Slobodanen
dc.date.accessioned2020-05-01T20:12:51Z-
dc.date.available2020-05-01T20:12:51Z-
dc.date.issued2005-01-01en
dc.identifier.issn0925-1022en
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/1177-
dc.description.abstractGeneralized line graphs were introduced by Hoffman Proc. Calgary Internat. Conf. on Combinatorial Structures and their applications, Gordon and Breach, New York (1970); they were characterized in 1980 by a collection of 31 forbidden induced subgraphs, obtained independently by Cvetković et al., Comptes Rendus Math. Rep. Acad. Sci. Canada (1980) and S. B. Rao et al., Proc. Second Symp., Indian Statistical Institute, Calcutta, Lecture Notes in Math., (1981). Here a short new proof of this characterization theorem is given, based on an edge-colouring technique.en
dc.publisherSpringer Link-
dc.relation.ispartofDesigns, Codes, and Cryptographyen
dc.subjectForbidden subgraphs | Generalized line graphs | Graph spectra | Least eigenvalueen
dc.titleGraphs with least eigenvalue -2: A new proof of the 31 forbidden subgraphs theoremen
dc.typeArticleen
dc.identifier.doi10.1007/s10623-004-4856-5en
dc.identifier.scopus2-s2.0-14644405583en
dc.relation.firstpage229en
dc.relation.lastpage240en
dc.relation.issue2-3en
dc.relation.volume34en
dc.description.rankM22-
item.cerifentitytypePublications-
item.openairetypeArticle-
item.fulltextNo Fulltext-
item.grantfulltextnone-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
Show simple item record

SCOPUSTM   
Citations

6
checked on Jul 12, 2024

Page view(s)

38
checked on May 9, 2024

Google ScholarTM

Check

Altmetric

Altmetric


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