Open Access System for Information Sharing

Login Library

 

Article
Cited 9 time in webofscience Cited 9 time in scopus
Metadata Downloads
Full metadata record
Files in This Item:
There are no files associated with this item.
DC FieldValueLanguage
dc.contributor.authorBang, S-
dc.contributor.authorHiraki, A-
dc.contributor.authorKoolen, JH-
dc.date.accessioned2016-04-01T02:40:46Z-
dc.date.available2016-04-01T02:40:46Z-
dc.date.created2010-11-24-
dc.date.issued2010-03-
dc.identifier.issn0911-0119-
dc.identifier.other2010-OAK-0000022013-
dc.identifier.urihttps://oasis.postech.ac.kr/handle/2014.oak/25572-
dc.description.abstractLet 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.statementofresponsibilityX-
dc.languageEnglish-
dc.publisherSPRINGER TOKYO-
dc.relation.isPartOfGRAPHS AND COMBINATORICS-
dc.subjectDelsarte clique-
dc.subjectDelsarte set graph-
dc.subjectDistance-regular graph-
dc.subjectJohnson graph-
dc.titleDelsarte Set Graphs with Small c(2)-
dc.typeArticle-
dc.contributor.college수학과-
dc.identifier.doi10.1007/S00373-010-0905-1-
dc.author.googleBang, S.-
dc.author.googleHiraki, A.-
dc.author.googleKoolen, J. H.-
dc.relation.volume26-
dc.relation.issue2-
dc.relation.startpage147-
dc.relation.lastpage162-
dc.contributor.id10200295-
dc.relation.journalGRAPHS AND COMBINATORICS-
dc.relation.indexSCI급, SCOPUS 등재논문-
dc.relation.sciSCIE-
dc.collections.nameJournal Papers-
dc.type.rimsART-
dc.identifier.bibliographicCitationGRAPHS AND COMBINATORICS, v.26, no.2, pp.147 - 162-
dc.identifier.wosid000275748300001-
dc.date.tcdate2019-02-01-
dc.citation.endPage162-
dc.citation.number2-
dc.citation.startPage147-
dc.citation.titleGRAPHS AND COMBINATORICS-
dc.citation.volume26-
dc.contributor.affiliatedAuthorKoolen, JH-
dc.identifier.scopusid2-s2.0-77953324891-
dc.description.journalClass1-
dc.description.journalClass1-
dc.description.wostc8-
dc.description.scptc5*
dc.date.scptcdate2018-05-121*
dc.type.docTypeArticle-
dc.subject.keywordAuthorDelsarte clique-
dc.subject.keywordAuthorDelsarte set graph-
dc.subject.keywordAuthorDistance-regular graph-
dc.subject.keywordAuthorJohnson graph-
dc.relation.journalWebOfScienceCategoryMathematics-
dc.description.journalRegisteredClassscie-
dc.description.journalRegisteredClassscopus-
dc.relation.journalResearchAreaMathematics-

qr_code

  • mendeley

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

Related Researcher

Views & Downloads

Browse