{"title":"Generalized competitively orientable complete multipartite graphs","authors":"Myungho Choi","doi":"10.1016/j.dam.2025.03.031","DOIUrl":null,"url":null,"abstract":"<div><div>We say that a digraph <span><math><mi>D</mi></math></span> is <span><math><mrow><mo>(</mo><mi>i</mi><mo>,</mo><mi>j</mi><mo>)</mo></mrow></math></span>-step competitive if any two vertices have an <span><math><mrow><mo>(</mo><mi>i</mi><mo>,</mo><mi>j</mi><mo>)</mo></mrow></math></span>-step common out-neighbor in <span><math><mi>D</mi></math></span> and that a graph <span><math><mi>G</mi></math></span> is <span><math><mrow><mo>(</mo><mi>i</mi><mo>,</mo><mi>j</mi><mo>)</mo></mrow></math></span>-step competitively orientable if there exists an <span><math><mrow><mo>(</mo><mi>i</mi><mo>,</mo><mi>j</mi><mo>)</mo></mrow></math></span>-step competitive orientation of <span><math><mi>G</mi></math></span>.</div><div>In Choi et al. (2022), Choi et al. introduce the notion of the competitive digraph and completely characterize competitively orientable complete multipartite graphs in terms of the sizes of its partite sets. Here, a competitive digraph means a <span><math><mrow><mo>(</mo><mn>1</mn><mo>,</mo><mn>1</mn><mo>)</mo></mrow></math></span>-step competitive digraph. In this paper, the result of Choi et al. has been extended to a general characterization of <span><math><mrow><mo>(</mo><mi>i</mi><mo>,</mo><mi>j</mi><mo>)</mo></mrow></math></span>-step competitively orientable complete multipartite graphs.</div></div>","PeriodicalId":50573,"journal":{"name":"Discrete Applied Mathematics","volume":"371 ","pages":"Pages 65-72"},"PeriodicalIF":1.0000,"publicationDate":"2025-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discrete Applied Mathematics","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0166218X25001556","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0
Abstract
We say that a digraph is -step competitive if any two vertices have an -step common out-neighbor in and that a graph is -step competitively orientable if there exists an -step competitive orientation of .
In Choi et al. (2022), Choi et al. introduce the notion of the competitive digraph and completely characterize competitively orientable complete multipartite graphs in terms of the sizes of its partite sets. Here, a competitive digraph means a -step competitive digraph. In this paper, the result of Choi et al. has been extended to a general characterization of -step competitively orientable complete multipartite graphs.
期刊介绍:
The aim of Discrete Applied Mathematics is to bring together research papers in different areas of algorithmic and applicable discrete mathematics as well as applications of combinatorial mathematics to informatics and various areas of science and technology. Contributions presented to the journal can be research papers, short notes, surveys, and possibly research problems. The "Communications" section will be devoted to the fastest possible publication of recent research results that are checked and recommended for publication by a member of the Editorial Board. The journal will also publish a limited number of book announcements as well as proceedings of conferences. These proceedings will be fully refereed and adhere to the normal standards of the journal.
Potential authors are advised to view the journal and the open calls-for-papers of special issues before submitting their manuscripts. Only high-quality, original work that is within the scope of the journal or the targeted special issue will be considered.