✦ LIBER ✦

A property of a-fragments of a digraph

✍ Scribed by Yahya Ould Hamidoune

Book ID: 107748348
Publisher: Elsevier Science
Year: 1980
Tongue: English
Weight: 169 KB
Volume: 31
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(80)90180-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Decomposition of flowcharts using a digr

Decomposition of flowcharts using a digraph hierarchical property

✍ June Kato; Nobuhisa Miyake 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 1000 KB

A line digraph of a complete bipartite d

A line digraph of a complete bipartite digraph

✍ Juan Liu; Lin Sun; Jixiang Meng 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 310 KB

In the context of the degree/diameter problem for directed graphs, it is known that the number of vertices of a strongly connected bipartite digraph satisfies a Moore-like bound in terms of its diameter k and the maximum outdegrees (d 1 , d 2 ) of its partite sets of vertices. In this work, we defi

Different capacities of a digraph

✍ Anna Galluccio; Luisa Gargano; János Körner; Gábor Simonyi 📂 Article 📅 1994 🏛 Springer Japan 🌐 English ⚖ 942 KB

On a property ofn-edge-connected digraph

On a property ofn-edge-connected digraphs

✍ W. Mader 📂 Article 📅 1981 🏛 Springer-Verlag 🌐 English ⚖ 112 KB

A lower bound for the recognition of dig

A lower bound for the recognition of digraph properties

✍ V. King 📂 Article 📅 1990 🏛 Springer-Verlag 🌐 English ⚖ 365 KB

A new Bartholdi zeta function of a digra

A new Bartholdi zeta function of a digraph

✍ Hirobumi Mizuno; Iwao Sato 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 185 KB