✦ LIBER ✦

p-competition numbers

✍ Scribed by Suh-ryung Kim; Terry A. McKee; F.R. McMorris; Fred S. Roberts

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 431 KB
Volume: 46
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(93)90160-p

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Chromatic numbers of competition graphs

✍ J.Richard Lundgren; Sarah K. Merz; Craig W. Rasmussen 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 964 KB

The competition numbers of ternary Hammi

The competition numbers of ternary Hamming graphs

✍ Boram Park; Yoshio Sano 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 243 KB

It is known to be a hard problem to compute the competition number k(G) of a graph G in general. Park and Sano (in press) [16] gave the exact values of the competition numbers of Hamming graphs H(n, q) if 1 ≤ n ≤ 3 or 1 ≤ q ≤ 2. In this paper, we give an explicit formula for the competition numbers

p-competition graphs

✍ Suh-ryung Kim; Terry A. McKee; F.R. McMorris; Fred S. Roberts 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 892 KB

On the double competition number

✍ Zoltán Füredi 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 308 KB

It is known, that for U/~IIOS~ all /z-vertex simple graphs one needs S!(,j' '(log") ' ' ) extra vertices to obtain them as a double competition graph of a digraph. In this note a construction 15 given to shou that 2,~" ' are always sufficient.

Competition numbers of graphs with a sma

Competition numbers of graphs with a small number of triangles

✍ Suh-Ryung Kim; Fred S. Roberts 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 722 KB

If D is an acyclic digraph, its competition graph is an undirected graph with the same vertex set and an edge between vertices x and y if there is a vertex a so that (x, a) and (y, a) are both arcs of D. If G is any graph, G together with sufficiently many isolated vertices is a competition graph, a

P≠NC over the p-adic numbers

✍ Michael Maller; Jennifer Whitehead 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 130 KB

We show that in the Blum-Shub-Smale model of computation, over the p-adic numbers Q p ; the class NC Q p is strictly contained in the class P Q p : That is, there exist sets of p-adic numbers which can be recognized in sequential polynomial time, but which cannot be recognized in polylogarithmic par