DC Field | Value | Language |
---|---|---|
dc.contributor.author | Jurisic, A | - |
dc.contributor.author | Koolen, J | - |
dc.contributor.author | Miklavic, S | - |
dc.date.accessioned | 2016-04-01T09:12:09Z | - |
dc.date.available | 2016-04-01T09:12:09Z | - |
dc.date.created | 2009-03-05 | - |
dc.date.issued | 2005-07 | - |
dc.identifier.issn | 0095-8956 | - |
dc.identifier.other | 2005-OAK-0000010609 | - |
dc.identifier.uri | https://oasis.postech.ac.kr/handle/2014.oak/29641 | - |
dc.description.abstract | We classify triangle- and pentagon-free distance-regular graphs with diameter d >= 2, valency k, and an eigenvalue multiplicity k. In particular, we prove that such a graph is isomorphic to a cycle, a k-cube, a complete bipartite graph minus a matching, a Hadamard graph, a distance-regular graph with intersection array {k, k-1, k-c, c, 1; 1, c, k-c, k-1, k}, where k = gamma(gamma(2) + 3 gamma + 1), c = gamma(gamma + 1), gamma is an element of N, or a folded k-cube, k odd and k >= 7. This is a generalization of the results of Nomura (J. Combin. Theory Ser. B 64 (1995) 300-313) and Yamazaki (J. Combin. Theory Ser. B 66 (1996) 34-37), where they classified bipartite distance-regular graphs with an eigenvalue multiplicity k and showed that all such graphs are 2-homogeneous. We also classify bipartite almost 2-homogeneous distance-regular graphs with diameter d >=, 4. In particular, we prove that such a graph is either 2-homogeneous (and thus classified by Nomura and Yamazaki), or a folded k-cube for k even, or a generalized 2d-gon with order (1, k-1). (c) 2005 Elsevier Inc. All rights reserved. | - |
dc.description.statementofresponsibility | X | - |
dc.language | English | - |
dc.publisher | ACADEMIC PRESS INC ELSEVIER SCIENCE | - |
dc.relation.isPartOf | JOURNAL OF COMBINATORIAL THEORY SERIES B | - |
dc.subject | distance-regular graphs | - |
dc.subject | triangle and pentagon free | - |
dc.subject | Eigen value multiplicity | - |
dc.subject | 2-homogeneous graphs | - |
dc.subject | almost bipartity graphs | - |
dc.title | Triangle- and pentagon-free distance-regular graphs with an eigenvalue multiplicity equal to the valency | - |
dc.type | Article | - |
dc.contributor.college | 수학과 | - |
dc.identifier.doi | 10.1016/J.JCTB.2005. | - |
dc.author.google | Jurisic, A | - |
dc.author.google | Koolen, J | - |
dc.author.google | Miklavic, S | - |
dc.relation.volume | 94 | - |
dc.relation.issue | 2 | - |
dc.relation.startpage | 245 | - |
dc.relation.lastpage | 258 | - |
dc.contributor.id | 10200295 | - |
dc.relation.journal | JOURNAL OF COMBINATORIAL THEORY SERIES B | - |
dc.relation.index | SCI급, SCOPUS 등재논문 | - |
dc.relation.sci | SCI | - |
dc.collections.name | Journal Papers | - |
dc.type.rims | ART | - |
dc.identifier.bibliographicCitation | JOURNAL OF COMBINATORIAL THEORY SERIES B, v.94, no.2, pp.245 - 258 | - |
dc.identifier.wosid | 000229947400004 | - |
dc.date.tcdate | 2019-02-01 | - |
dc.citation.endPage | 258 | - |
dc.citation.number | 2 | - |
dc.citation.startPage | 245 | - |
dc.citation.title | JOURNAL OF COMBINATORIAL THEORY SERIES B | - |
dc.citation.volume | 94 | - |
dc.contributor.affiliatedAuthor | Koolen, J | - |
dc.identifier.scopusid | 2-s2.0-20344376651 | - |
dc.description.journalClass | 1 | - |
dc.description.journalClass | 1 | - |
dc.description.wostc | 6 | - |
dc.type.docType | Article | - |
dc.subject.keywordAuthor | distance-regular graphs | - |
dc.subject.keywordAuthor | triangle and pentagon free | - |
dc.subject.keywordAuthor | Eigen value multiplicity | - |
dc.subject.keywordAuthor | 2-homogeneous graphs | - |
dc.subject.keywordAuthor | almost bipartity graphs | - |
dc.relation.journalWebOfScienceCategory | Mathematics | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Mathematics | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.
library@postech.ac.kr Tel: 054-279-2548
Copyrights © by 2017 Pohang University of Science ad Technology All right reserved.