✦ LIBER ✦

The Directed Geodetic Structure of a Strong Digraph

✍ Scribed by Ladislav Nebeský

Book ID: 111577394
Publisher: Springer
Year: 2004
Tongue: English
Weight: 116 KB
Volume: 54
Category: Article
ISSN: 0011-4642
DOI: 10.1023/b:cmaj.0000027243.70276.51

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The geodetic numbers of graphs and digra

The geodetic numbers of graphs and digraphs

✍ Chang-hong Lu 📂 Article 📅 2007 🏛 SP Science China Press 🌐 English ⚖ 320 KB

On the structure of strong 3-quasi-trans

On the structure of strong 3-quasi-transitive digraphs

✍ Hortensia Galeana-Sánchez; Ilan A. Goldfeder; Isabel Urrutia 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 262 KB

On the restricted arc-connectivity ofs-g

On the restricted arc-connectivity ofs-geodetic digraphs

✍ Camino Balbuena; Pedro García-Vázquez 📂 Article 📅 2010 🏛 Institute of Mathematics, Chinese Academy of Scien 🌐 English ⚖ 237 KB

The Number of Strong Digraphs

✍ Wright, E. M. 📂 Article 📅 1971 🏛 Oxford University Press 🌐 English ⚖ 417 KB

Bounds of the longest directed cycle len

Bounds of the longest directed cycle length for minimal strong digraphs

✍ Zhi-bo Chen; Fu-ji Zhang 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 532 KB

In this paper we present the upper and lower bounds of the longest directed cycle length for minimal strr,ng digraphs in terms of the numbers of vertices and arcs. These bounds are both sharp. In addition, we give analogous results for minimal 2-edge connected graphs.

On the exponent of a primitive, minimall

On the exponent of a primitive, minimally strong digraph

✍ Yang Shangjun; George P. Barker 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 960 KB