On distance-regular graphs with Ki = kj

Let be a distance regular graph with diameter d and valency k. For nonnegative integers i and j, with 0 i + j d and vertices u, v E , letki = number of points at distance i from u and kj = number of points at distance j from v. This thesis is a detailed study about distance regular graphs satisfying...

全面介紹

Saved in:
書目詳細資料
主要作者: Garcia, Imelda B.
格式: text
語言:English
出版: Animo Repository 1994
主題:
在線閱讀:https://animorepository.dlsu.edu.ph/etd_masteral/1643
https://animorepository.dlsu.edu.ph/context/etd_masteral/article/8481/viewcontent/TG02363_F_Redacted.pdf
標簽: 添加標簽
沒有標簽, 成為第一個標記此記錄!
機構: De La Salle University
語言: English