✦ LIBER ✦

A characterization of competition graphs of arbitrary digraphs

✍ Scribed by Fred S. Roberts; Jeffrey E. Steif

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

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The competition-common enemy graph of a

The competition-common enemy graph of a digraph

✍ Debra D. Scott 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 535 KB

A characterization of competition graphs

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

A characterization of graphs of competit

A characterization of graphs of competition number m

✍ J.Richard Lundgren; John S. Maybee 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 245 KB

Generalized competition index of a primi

Generalized competition index of a primitive digraph

✍ Hwa Kyung Kim 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 164 KB

Catalogues of graphs and digraphs

📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 81 KB

We have recently completed the computer generation of a catalogue of all the 12,(b05,168 unlabelled graphs on 10 vertices, and are willing to make this catalogue available to those interested. The catalogue consists of two magnetic tapes; one contains all ten-vertex graphs on up to 20 edges, the ot

A characterization of Thompson digraphs

✍ Dora Giammarresi; Jean-Luc Ponty; Derick Wood; Djelloul Ziadi 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 398 KB

A ÿnite-state machine is called a Thompson machine if it can be constructed from an emptyfree regular expression using the construction of Thompson as modiÿed by Hopcroft and Ullman. We call the underlying digraph of a Thompson machine a Thompson digraph. We characterize Thompson digraphs and we giv