✦ LIBER ✦

On the Computation of the Competition Number of a Graph

✍ Scribed by Opsut, Robert J.

Book ID: 118212996
Publisher: Society for Industrial and Applied Mathematics
Year: 1982
Weight: 931 KB
Volume: 3
Category: Article
ISSN: 0196-5212
DOI: 10.1137/0603043

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The competition number of a graph with

✍ Bo-Jr Li; Gerard J. Chang 📂 Article 📅 2010 🏛 Springer US 🌐 English ⚖ 349 KB

Computing the binding number of a graph

✍ William H. Cunningham 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 189 KB

Computing the isoperimetric number of a

Computing the isoperimetric number of a graph

✍ P. A. Golovach 📂 Article 📅 1994 🏛 Springer US 🌐 English ⚖ 279 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

The competition numbers of complete trip

The competition numbers of complete tripartite graphs

✍ Suh-Ryung Kim; Yoshio Sano 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 300 KB

Parallel computation of the Euler number

Parallel computation of the Euler number via Connectivity Graph

✍ Franco Chiavetta; Vito Di Gesù 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 583 KB