{"title":"Extremal Digraphs Avoiding Distinct Walks of Length 4 with the Same Endpoints","authors":"Zhenhua Lyu","doi":"10.7151/dmgt.2321","DOIUrl":null,"url":null,"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.","PeriodicalId":48875,"journal":{"name":"Discussiones Mathematicae Graph Theory","volume":null,"pages":null},"PeriodicalIF":0.5000,"publicationDate":"2022-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discussiones Mathematicae Graph Theory","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.7151/dmgt.2321","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 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.
期刊介绍:
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.