Extremal Digraphs Avoiding Distinct Walks of Length 4 with the Same Endpoints

IF 0.5 4区数学 Q3 MATHEMATICS

Discussiones Mathematicae Graph Theory Pub Date : 2022-06-29 DOI:10.7151/dmgt.2321

Zhenhua Lyu

引用次数: 8

Abstract

Abstract Let n ≥ 8 be an integer. We characterize the extremal digraphs of order n with the maximum number of arcs avoiding distinct walks of length 4 with the same endpoints.

查看原文本刊更多论文

极值有向图避免具有相同端点的长度为4的不同行走

设n≥8为整数。我们用最大数量的弧来刻画n阶的极值有向图，以避免相同端点的长度为4的不同行走。

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

求助全文

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

来源期刊

Discussiones Mathematicae Graph Theory MATHEMATICS-

CiteScore

2.20

自引率

0.00%

发文量

审稿时长

53 weeks

期刊介绍： The Discussiones Mathematicae Graph Theory publishes high-quality refereed original papers. Occasionally, very authoritative expository survey articles and notes of exceptional value can be published. The journal is mainly devoted to the following topics in Graph Theory: colourings, partitions (general colourings), hereditary properties, independence and domination, structures in graphs (sets, paths, cycles, etc.), local properties, products of graphs as well as graph algorithms related to these topics.