中文
相关论文

相关论文: The niche graphs of bipartite tournaments

200 篇论文

In this paper, we discover all the triangle-free graphs that are competition graphs of multipartite tournaments.

组合数学 · 数学 2023-03-23 Myungho Choi , Minki Kwak , Suh-Ryung Kim

In this paper, we completely characterize the $m$-step competition graph of a bipartite tournament for any integer $m \ge 2$. In addition, we compute the competition index and the competition period of a bipartite tournament.

组合数学 · 数学 2019-03-14 Soogang Eoh , Suh-Ryung Kim , Hyesun Yoon

In this note we give a combinatorial characterization of all the unmixed bipartite graphs.

组合数学 · 数学 2011-04-05 Rafael H. Villarreal

In this paper, we study $(1,2)$-step competition graphs of bipartite tournaments. A bipartite tournament means an orientation of a complete bipartite graph. We show that the $(1,2)$-step competition graph of a bipartite tournament has at…

组合数学 · 数学 2016-11-11 Jihoon Choi , Soogang Eoh , Suh-Ryung Kim , So Jung Lee

Ranking the participants of a tournament has applications in voting, paired comparisons analysis, sports and other domains. In this paper we introduce bipartite tournaments, which model situations in which two different kinds of entity…

多智能体系统 · 计算机科学 2021-01-08 Joseph Singleton , Richard Booth

The niche graph of a digraph $D$ has $V(D)$ as the vertex set and an edge $uv$ if and only if $(u,w) \in A(D)$ and $(v,w) \in A(D)$, or $(w,u) \in A(D)$ and $(w,v) \in A(D)$ for some $w \in V(D)$. The notion of niche graph was introduced by…

组合数学 · 数学 2019-11-12 Soogang Eoh , Myungho Choi , Suh-Ryung Kim

A multipartite tournament is an orientation of a complete $k$-partite graph for some positive integer $k\geq 3$. We say that a multipartite tournament $D$ is tight if every partite set forms a clique in the $(1,2)$-step competition graph,…

组合数学 · 数学 2024-02-20 Myungho Choi , Suh-Ryung Kim

A multipartite tournament is an orientation of a complete $k$-partite graph for some positive integer $k\geq 3$. We say that a multipartite tournament $D$ is tight if every partite set forms a clique in the $(1,2)$-step competition graph,…

组合数学 · 数学 2024-02-06 Myungho Choi , Suh-Ryung Kim

A classification is given of all the countable homogeneous ordered bipartite graphs.

组合数学 · 数学 2024-01-17 J. K. Truss

This paper is a survey on Extremal Graph Theory, primarily focusing on the case when one of the excluded graphs is bipartite. On one hand we give an introduction to this field and also describe many important results, methods, problems, and…

组合数学 · 数学 2013-07-02 Zoltán Füredi , Miklós Simonovits

A regular bipartite tournament is an orientation of a complete balanced bipartite graph $K_{2n,2n}$ where every vertex has its in- and outdegree both equal to $n$. In 1981, Jackson conjectured that any regular bipartite tournament can be…

组合数学 · 数学 2022-09-08 Bertille Granet

In this article, we introduce the notion of the double competition multigraph of a digraph. We give characterizations of the double competition multigraphs of arbitrary digraphs, loopless digraphs, reflexive digraphs, and acyclic digraphs…

组合数学 · 数学 2016-02-02 Jeongmi Park , Yoshio Sano

We determine which properties of 2-layer drawings characterise bipartite graphs of bounded pathwidth.

组合数学 · 数学 2022-07-15 David R. Wood

Bipartite graphs have received some attention in the study of social networks and of biological mutualistic systems. A generalization of a previous model is presented, that evolves the topology of the graph in order to optimally account for…

物理与社会 · 物理学 2009-11-13 Enrique Burgos , Horacio Ceva , Laura Hernandez , R. P. J. Perazzo , Mariano Devoto , Diego Medan

In this paper, we investigate odd graceful graph, odd strongly harmonious graph, bipartite graph and their relationship. We proved following results: (1) if G is odd strongly harmonious graph, then G is odd graceful graph ;(2) if G is…

组合数学 · 数学 2020-01-06 Xiuying Wang , Ying Zhoua , Haihong Wanga , Chunfeng Liu

In this paper we study the main characteristics of some evaluation codes parameterized by the edges of a bipartite graph with a perfect matching.

组合数学 · 数学 2022-10-04 Manuel Gonzalez Sarabia , Rafael H. Villarreal

Decomposing a digraph into subdigraphs with a fixed structure or property is a classical problem in graph theory and a useful tool in a number of applications of networks and communication. A digraph is strongly connected if it contains a…

组合数学 · 数学 2018-12-18 A. P. Figueroa , J. J. Montellano-Ballesteros , M. Olsen

A digraph is semicomplete multipartite if its underlying graph is a complete multipartite graph. As a special case of semicomplete multipartite digraphs, J{\o}rgensen et al. \cite{JG14} initiated the study of doubly regular team…

组合数学 · 数学 2025-01-22 Shuang Li , Yuefeng Yang , Kaishun Wang

We consider a set of cliques in any multipartite graph with two vertices in each part. Moreover, we construct a class of peculiar polytopes. Key words: multipartite graph, clique, polytope.

组合数学 · 数学 2007-05-23 Julia V. Grishicheva , Alexander V. Seliverstov

The class of bipartite permutation graphs enjoys many nice and important properties. In particular, this class is critically important in the study of clique- and rank-width of graphs, because it is one of the minimal hereditary classes of…

组合数学 · 数学 2020-10-28 Bogdan Alecu , Vadim Lozin , Dmitriy Malyshev
‹ 上一页 1 2 3 10 下一页 ›