• 沒有找到結果。

正則擬多邊形的研究

N/A
N/A
Protected

Academic year: 2021

Share "正則擬多邊形的研究"

Copied!
2
0
0

加載中.... (立即查看全文)

全文

(1)

行政院國家科學委員會專題研究計畫 成果報告

正則擬多邊形的研究

計畫類別: 個別型計畫

計畫編號: NSC92-2115-M-009-017-

執行期間: 92 年 08 月 01 日至 93 年 07 月 31 日

執行單位: 國立交通大學應用數學系

計畫主持人: 翁志文

報告類型: 精簡報告

處理方式: 本計畫可公開查詢

中 華 民 國 93 年 9 月 1 日

(2)

•Åo»I. õºÝÞ@~ŒiWŒ ×

Œi_rNSC

92-2115-M-009-017-ƕ§92O8`1^‹93O7`31^

x¹ßZ

»ñø;.Tàó.

weng@math.nctu.edu.tw

93

O8`31^

×Z`Š ƒ Γ Îà5 D ≥ 3 ‰› k ÝÑJa9\ Í 8ø¢ó a1> 0, c2> 1. ƒ θ1 Γ ÏÞÝ©Ç Â 3hŒi&ÆÿÕ θ1≤ k − a1− c2 c2− 1 .

&ÆJ€|ì (i)–(iii) ·‰Ý: (i) îP‡r Wñ; (ii) Γ Ey θ1 Î Q-94P; (iii) Γ ÎE‰Á% T“­õ% 9͔Œ Paul Terwilliger )®Þs y European Journal of Combinatorics.

n"Þ a9\; ûÒÑJ%; Q-94P; E‰Á %; “­õ%

Abstract Let Γ denote a near polygon distance-regular graph with diameter d ≥ 3, valency k and intersection numbers a1 > 0, c2 > 1. Let θ1 denote the second largest eigenvalue of Γ. We show

θ1≤

k − a1− c2 c2− 1

.

We show the following (i)–(iii) are equivalent. (i) Equality is attained above; (ii) Γ is Q-polynomial with respect to θ1; (iii) Γ is a dual polar graph or a Hamming graph.

Keywords: near polygon, distance-regular graph, Q-polynomial, dual polar graph, Hamming graph. Þ`ãêÝ

ƒ Γ Î×Íà5 D C8ø¢ó ai, bi, ci (0 ≤ i ≤ D)ÝûÒÑJ% ƒ' Γ îtç(àa) ÝFó KÎ a1+ 2 &Æêƒ'AEŒàa ` ×F xÝûÒ ∂(`, x) y D `Ä°×D3× ` îÝF y ”• ∂(`, x) = ∂(y, x) J&ÆÌ Γ Î×ÍÑJa 9\ AŒ Γ E ∂(`, x) = D `ôb|îP² J Γ ÌÎ×ÑJa 2D \ AŒ Γ E ∂(`, x) = D ` Xb ` îÝF y K”• ∂(`, x) = ∂(y, x) J Ì Γ Î×ÑJa 2D + 1 \ [2] ÿÕnyÑJ a 2D \Ý¥Š”Œ D ≤ 3 a1 = 0 c2 = 1 T c3= c22− c2+ 1 [1, p206] ¼Œ9”ŒÝJ € b×Í2]ÝD¡Îý0Ý͌i|Š Xî«®Þ ›^ ¬TEÑJa 2D + 1 \ô ÿÕv«”Œ 딌D¡ &ÆݔŒ¬^ŠXÞ ¬ÿÕ×Í E?½ÝÑJa9\ôÊà݇P 9Í ‡P‡rWñ` &Ɲ|X9Í% Þ û&ÆÝ]° •|ÑiÑJ 2D \ qA [1]Ý Proposition 4.4.6(i), &Æb|ìÌ Hoffman bound݇P: θD≥ − k a1+ 1 , ͇rWñ uv°u Γ Î×ÑJa 2D \ h θD Î Γ ÝtÝ©Ç ãy9͔Œ&Æ Ý”ŒÝ8«P ËïA¢”)!8¿à @s× ° è  Þ¼?h]'Äæ °ŒWŒŠÝ hŒi4ÿÕ×̛”¡ h”Œô Euro-pean Journal of Combinatorics#å ¬EÑJa9 \ Γ ÝÑib×°Äæè 

"¢Z¤

[1 ] A.E. Brouwer, A.M. Cohen, A. Neu-maier, Distance-Regular Graphs, Springer-Verlag, 1989

[2 ] A. E. Brouwer, H.A. Wilbrink, The structure of near polygons with quads, Geom. Dedicata 14:145-176, 1983

參考文獻

相關文件

• 下面介紹三種使用 greedy algorithm 產生 minimum cost s panning

 From a source vertex, systematically follow the edges of a graph to visit all reachable vertices of the graph.  Useful to discover the structure of

• Suppose the input graph contains at least one tour of the cities with a total distance at most B. – Then there is a computation path for

What was more surprising, when the sides of the two equilateral polygons changed at a certain rate, the pattern of the generated graph would become a tessellation.. Then we could

From these results, we study fixed point problems for nonlinear mappings, contractive type mappings, Caritsti type mappings, graph contractive type mappings with the Bregman distance

We will give a quasi-spectral characterization of a connected bipartite weighted 2-punctually distance-regular graph whose halved graphs are distance-regular.. In the case the

Miroslav Fiedler, Praha, Algebraic connectivity of graphs, Czechoslovak Mathematical Journal 23 (98) 1973,

We give a quasi- spectral characterization of a connected bipartite weighted 2-punctually distance- regular graph whose halved graphs are distance-regular.. In the case the