An inequality for regular near polygons

doi:10.1016/j.ejc.2004.03.001

完整後設資料紀錄

DC 欄位	值	語言
dc.contributor.author	Terwilliger, P	en_US
dc.contributor.author	Weng, CW	en_US
dc.date.accessioned	2014-12-08T15:34:45Z	-
dc.date.available	2014-12-08T15:34:45Z	-
dc.date.issued	2005-02-01	en_US
dc.identifier.issn	0195-6698	en_US
dc.identifier.uri	http://dx.doi.org/10.1016/j.ejc.2004.03.001	en_US
dc.identifier.uri	http://hdl.handle.net/11536/23655	-
dc.description.abstract	Let Gamma denote a near polygon distance-regular graph with diameter d greater than or equal to 3, valency k and intersection numbers a(1) > 0, c(2) > 1. Let theta(1) denote the second largest eigenvalue of Gamma. We show theta(1) less than or equal to k - a(1) - c(2)/ c(2) - 1. We show the following (i)-(iii) are equivalent. (i) Equality is attained above; (ii) Gamma is Q-polynomial with respect to theta(1); (iii) Gamma is a dual polar graph or a Hamming graph. (C) 2004 Elsevier Ltd. All rights reserved.	en_US
dc.language.iso	en_US	en_US
dc.subject	near polygon	en_US
dc.subject	distance-regular graph	en_US
dc.subject	Q-polynomial	en_US
dc.subject	dual polar graph	en_US
dc.subject	Hamming graph	en_US
dc.title	An inequality for regular near polygons	en_US
dc.type	Article	en_US
dc.identifier.doi	10.1016/j.ejc.2004.03.001	en_US
dc.identifier.journal	EUROPEAN JOURNAL OF COMBINATORICS	en_US
dc.citation.volume	26	en_US
dc.citation.issue	2	en_US
dc.citation.spage	227	en_US
dc.citation.epage	235	en_US
dc.contributor.department	應用數學系	zh_TW
dc.contributor.department	Department of Applied Mathematics	en_US
dc.identifier.wosnumber	WOS:000226352100006	-
dc.citation.woscount	2	-
顯示於類別：	期刊論文

文件中的檔案：

000226352100006.pdf

若為 zip 檔案，請下載檔案解壓縮後，用瀏覽器開啟資料夾中的 index.html 瀏覽全文。