On distance-regular graphs Γ of diameter 3 for which Γ3 is a triangle-free graph

IF 0.3 Q4 MATHEMATICS, APPLIED

Discrete Mathematics and Applications Pub Date : 2023-08-01 DOI:10.1515/dma-2023-0018

A. Makhnev, Wenbin Guo

引用次数: 0

Abstract

Abstract There exist well-known distance-regular graphs Γ of diameter 3 for which Γ3 is a triangle-free graph. An example is given by the Johnson graph J (8, 3) with the intersection array {15, 8, 3;1, 4, 9}. The paper is concerned with the problem of the existence of distance-regular graphs Γ with the intersection arrays {78, 50, 9;1, 15, 60} and {174, 110, 18;1, 30, 132} for which Γ3 is a triangle-free graph.

查看原文本刊更多论文

关于直径为3的距离正则图Γ，其中Γ3是无三角形图

存在已知的直径为3的距离正则图Γ，其中Γ3是一个无三角形图。Johnson图J（8，3）给出了一个例子，其中交叉数组{15，8，3；1，4，9}。本文讨论了具有交数组{78,50,9；1,15,60}和{174110,18,130132}的距离正则图Γ的存在性问题，其中Γ3是无三角形图。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Discrete Mathematics and Applications MATHEMATICS, APPLIED-

CiteScore

0.60

自引率

20.00%

发文量

期刊介绍： The aim of this journal is to provide the latest information on the development of discrete mathematics in the former USSR to a world-wide readership. The journal will contain papers from the Russian-language journal Diskretnaya Matematika, the only journal of the Russian Academy of Sciences devoted to this field of mathematics. Discrete Mathematics and Applications will cover various subjects in the fields such as combinatorial analysis, graph theory, functional systems theory, cryptology, coding, probabilistic problems of discrete mathematics, algorithms and their complexity, combinatorial and computational problems of number theory and of algebra.