3-bounded property in a triangle-free distance-regular graph

Full metadata record

DC Field	Value	Language
dc.contributor.author	Pan, Yeh-jong	en_US
dc.contributor.author	Weng, Chih-wen	en_US
dc.date.accessioned	2014-12-08T15:10:54Z	-
dc.date.available	2014-12-08T15:10:54Z	-
dc.date.issued	2008-10-01	en_US
dc.identifier.issn	0195-6698	en_US
dc.identifier.uri	http://dx.doi.org/10.1016/j.ejc.2007.10.002	en_US
dc.identifier.uri	http://hdl.handle.net/11536/8336	-
dc.description.abstract	Let Gamma denote a distance-regular graph with classical parameters (D, b, alpha, beta) and D >= 3. Assume the intersection numbers a(1) = 0 and a(2) not equal 0. We show that Gamma is 3-bounded in the sense of the article [C. Weng, D-bounded distance-regular graphs, European Journal of Combinatorics 18 (1997) 211-229]. (c) 2007 Elsevier Ltd. All rights reserved.	en_US
dc.language.iso	en_US	en_US
dc.title	3-bounded property in a triangle-free distance-regular graph	en_US
dc.type	Article	en_US
dc.identifier.doi	10.1016/j.ejc.2007.10.002	en_US
dc.identifier.journal	EUROPEAN JOURNAL OF COMBINATORICS	en_US
dc.citation.volume	29	en_US
dc.citation.issue	7	en_US
dc.citation.spage	1634	en_US
dc.citation.epage	1642	en_US
dc.contributor.department	應用數學系	zh_TW
dc.contributor.department	Department of Applied Mathematics	en_US
dc.identifier.wosnumber	WOS:000257856100013	-
dc.citation.woscount	1	-
Appears in Collections:	Articles

Files in This Item:

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.