Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 0905.3942

Cycles and p-competition graphs

Suh-Ryung Kim·Boram Park·Yoshio Sano
View original source ↗Read source document ↗Export metadata ↓

Abstract

The notion of p-competition graphs of digraphs was introduced by S-R. Kim, T. A. McKee, F. R. McMorris, and F. S. Roberts [p-competition graphs, Linear Algebra Appl., 217 (1995) 167--178] as a generalization of the competition graphs of digraphs. Let p be a positive integer. The p-competition graph C_p(D) of a digraph D=(V,A) is a (simple undirected) graph which has the same vertex set V and has an edge between distinct vertices x and y if and only if there exist p distinct vertices v_1, ..., v_p in V such that (x,v_i), (y,v_i) are arcs of the digraph D for each i=1, ..., p. In this paper, given a cycle of length n, we compute exact values of p in terms of n such that it is a p-competition graph, which generalizes the results obtained by Kim et al. We also find values of p in terms of n so that its complement is a p-competition graph.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Suh-Ryung Kim, Boram Park, Yoshio Sano. 2009-05-25. Cycles and p-competition graphs. https://arxiv.org/abs/0905.3942

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO↗
arXiv2026

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO↗