DC Field | Value | Language |
---|---|---|
dc.contributor.author | Bell, Francis | en |
dc.contributor.author | Simić, Slobodan | en |
dc.date.accessioned | 2020-05-01T20:12:51Z | - |
dc.date.available | 2020-05-01T20:12:51Z | - |
dc.date.issued | 2004-01-15 | en |
dc.identifier.issn | 0024-3795 | en |
dc.identifier.uri | http://researchrepository.mi.sanu.ac.rs/handle/123456789/1179 | - |
dc.description.abstract | It was proved recently by one of the authors that, if H is a path P t (t > 2 with t ≠ 7 or 8) or an odd cycle Ct (t > 3), then there is a unique maximal graph having H as a star complement for -2. The methods employed were analytical in nature, making use of the Reconstruction Theorem for star complements. Here we offer an alternative approach, based on the forbidden subgraph technique. In addition, we resolve the exceptional situations arising when H = P7 or P8. | en |
dc.publisher | Elsevier | - |
dc.relation.ispartof | Linear Algebra and Its Applications | en |
dc.subject | Adjacency matrix | Cycle | Exceptional graph | Graph eigenvalues | Path | en |
dc.title | On graphs whose star complement for -2 is a path or a cycle | en |
dc.type | Article | en |
dc.identifier.doi | 10.1016/j.laa.2003.08.016 | en |
dc.identifier.scopus | 2-s2.0-0242335040 | en |
dc.relation.firstpage | 249 | en |
dc.relation.lastpage | 265 | en |
dc.relation.issue | 1-3 | en |
dc.relation.volume | 377 | en |
dc.description.rank | M22 | - |
item.grantfulltext | none | - |
item.cerifentitytype | Publications | - |
item.fulltext | No Fulltext | - |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
item.openairetype | Article | - |
SCOPUSTM
Citations
8
checked on Sep 6, 2024
Page view(s)
1
checked on Sep 7, 2024
Google ScholarTM
Check
Altmetric
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.