On distance-regular graphs in which the neighborhood of each vertex is isomorphic to the Hoffman-Singleton graph

被引：0

|

作者：

A. L. Gavrilyuk

A. A. Makhnev

机构：

[1] Russian Academy of Sciences,Institute of Mathematics and Mechanics, Ural Division

来源：

Doklady Mathematics | 2009年 / 80卷

关键词：

Regular Graph; DOKLADY Mathematic; Distinct Eigenvalue; Intersection Array; Distance Regular Graph;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

引用

收藏

页码：665 / 668

页数：3

相关论文

共 32 条

[31] The Terwilliger polynomial of a Q-polynomial distance-regular graph and its application to pseudo-partition graphs
Gavrilyuk, Alexander L.
Koolen, Jack H.
LINEAR ALGEBRA AND ITS APPLICATIONS, 2015, 466 : 117 - 140
[32] Graphs G where G-N[v]\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$G-N[v]$$\end{document} is a regular graph for each vertex v
Bo Zhang
Baoyindureng Wu
Computational and Applied Mathematics, 2024, 43 (5)

← 1 2 3 4 →