Nonexistence of a Class of Distance-regular Graphs

檔案

本條目沒有附加檔案。

日期

2015-06-03

類型

期刊名稱

ELECTRONIC JOURNAL OF COMBINATORICS

卷期與頁次

第 22 卷

ISSN

1077-8926

語言

英文

摘要

Let Gamma denote a distance-regular graph with diameter D >= 3 and intersection numbers a(1) = 0, a(2) not equal 0, and c(2) = 1. We show a connection between the d-bounded property and the nonexistence of parallelograms of any length up to d + 1. Assume further that Gamma is with classical parameters (D, b, alpha, beta), Pan and Weng (2009) showed that (b, alpha, beta) = (-2, 2, ((-2)(D+1) -1)/3). Under the assumption D >= 4, we exclude this class of graphs by an application of the above connection.

所屬典藏

期刊論文
顯示完整詮釋資料 統計資料

引用此條目

Huang, Y.-P., Pan, Y.-J., & Weng, C.-W. (2015). Nonexistence of a Class of Distance-regular Graphs. ELECTRONIC JOURNAL OF COMBINATORICS, 22. https://ir.lib.nycu.edu.tw/handle/11536/128072

BibTeX RIS

引用文字依 APA 第 7 版格式自動產生,使用前請再核對。

分享

永久網址:https://ir.lib.nycu.edu.tw/handle/11536/128072