✦ LIBER ✦

A characterization of graphs of competition number m

✍ Scribed by J.Richard Lundgren; John S. Maybee

Publisher: Elsevier Science
Year: 1983
Tongue: English
Weight: 245 KB
Volume: 6
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(83)90086-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A characterization of competition graphs

✍ R.D. Dutton; R.C. Brigham 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 172 KB

Chromatic numbers of competition graphs

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

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

A characterization of competition graphs

A characterization of competition graphs of arbitrary digraphs

✍ Fred S. Roberts; Jeffrey E. Steif 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 271 KB

The double competition number of some tr

The double competition number of some triangle-free graphs

✍ Suzanne M. Seager 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 299 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