DC Field | Value | Language |
---|---|---|
dc.contributor.author | Bang, S | - |
dc.contributor.author | Hiraki, A | - |
dc.contributor.author | Koolen, JH | - |
dc.date.accessioned | 2016-04-01T02:40:46Z | - |
dc.date.available | 2016-04-01T02:40:46Z | - |
dc.date.created | 2010-11-24 | - |
dc.date.issued | 2010-03 | - |
dc.identifier.issn | 0911-0119 | - |
dc.identifier.other | 2010-OAK-0000022013 | - |
dc.identifier.uri | https://oasis.postech.ac.kr/handle/2014.oak/25572 | - |
dc.description.abstract | Let Gamma be a Delsarte set graph with an intersection number c(2) (i.e., a distance-regular graph with a set C of Delsarte cliques such that each edge lies in a positive constant number n(C) of Delsarte cliques in C). We showed in Bang et al. (J Combin 28:501-506, 2007) that if psi(1) > 1 then c(2) >= 2 psi(1) where psi(1) := vertical bar Gamma(1)(x)boolean AND C vertical bar for x is an element of V(Gamma) and C aDelsarte clique satisfying d(x, C) = 1. In this paper, we classify Gamma with the case c(2) = 2 psi(1) > 2. As a consequence of this result, we show that if c(2) <= 5 and psi(1) > 1 then Gamma is either a Johnson graph or a folded Johnson graph (J) over bar (4s, 2s) with s >= 3. | - |
dc.description.statementofresponsibility | X | - |
dc.language | English | - |
dc.publisher | SPRINGER TOKYO | - |
dc.relation.isPartOf | GRAPHS AND COMBINATORICS | - |
dc.subject | Delsarte clique | - |
dc.subject | Delsarte set graph | - |
dc.subject | Distance-regular graph | - |
dc.subject | Johnson graph | - |
dc.title | Delsarte Set Graphs with Small c(2) | - |
dc.type | Article | - |
dc.contributor.college | 수학과 | - |
dc.identifier.doi | 10.1007/S00373-010-0905-1 | - |
dc.author.google | Bang, S. | - |
dc.author.google | Hiraki, A. | - |
dc.author.google | Koolen, J. H. | - |
dc.relation.volume | 26 | - |
dc.relation.issue | 2 | - |
dc.relation.startpage | 147 | - |
dc.relation.lastpage | 162 | - |
dc.contributor.id | 10200295 | - |
dc.relation.journal | GRAPHS AND COMBINATORICS | - |
dc.relation.index | SCI급, SCOPUS 등재논문 | - |
dc.relation.sci | SCIE | - |
dc.collections.name | Journal Papers | - |
dc.type.rims | ART | - |
dc.identifier.bibliographicCitation | GRAPHS AND COMBINATORICS, v.26, no.2, pp.147 - 162 | - |
dc.identifier.wosid | 000275748300001 | - |
dc.date.tcdate | 2019-02-01 | - |
dc.citation.endPage | 162 | - |
dc.citation.number | 2 | - |
dc.citation.startPage | 147 | - |
dc.citation.title | GRAPHS AND COMBINATORICS | - |
dc.citation.volume | 26 | - |
dc.contributor.affiliatedAuthor | Koolen, JH | - |
dc.identifier.scopusid | 2-s2.0-77953324891 | - |
dc.description.journalClass | 1 | - |
dc.description.journalClass | 1 | - |
dc.description.wostc | 8 | - |
dc.description.scptc | 5 | * |
dc.date.scptcdate | 2018-05-121 | * |
dc.type.docType | Article | - |
dc.subject.keywordAuthor | Delsarte clique | - |
dc.subject.keywordAuthor | Delsarte set graph | - |
dc.subject.keywordAuthor | Distance-regular graph | - |
dc.subject.keywordAuthor | Johnson graph | - |
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.