✦ LIBER ✦

The competition-common enemy graph of a digraph

✍ Scribed by Debra D. Scott

Publisher: Elsevier Science
Year: 1987
Tongue: English
Weight: 535 KB
Volume: 17
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(87)90030-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Generalized competition index of a primi

Generalized competition index of a primitive digraph

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

Finding a minimum equivalent graph of a

Finding a minimum equivalent graph of a digraph

✍ Silvano Martello; Paolo Toth 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 537 KB

On the sum of all distances in a graph o

On the sum of all distances in a graph or digraph

✍ Ján Plesník 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 870 KB

The transmission of a graph or digraph G is the sum of all distances in G. StFict bounds on the transmission are collected and extended for several classes of graphs and digraphs. For example, in the class of 2connected or Z-edge-mnnected graphs of order n, the maximal transmission is realized only

The superconnectivity of large digraphs

The superconnectivity of large digraphs and graphs

✍ M.A. Fiol 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 696 KB

The connectivity of large digraphs and g

The connectivity of large digraphs and graphs

✍ M. A. Fiol 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 632 KB

## Abstract This paper studies the relation between the connectivity and other parameters of a digraph (or graph), namely its order __n__, minimum degree δ, maximum degree Δ, diameter __D__, and a new parameter l~pi;~, __0__ ≤ π ≤ δ − 2, related with the number of short paths (in the case of graphs