✦ LIBER ✦

Minimum k-geodetically connected digraphs

✍ Scribed by Ján Plesník

Publisher: John Wiley and Sons
Year: 2004
Tongue: English
Weight: 192 KB
Volume: 44
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.30036

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Towards minimum k-geodetically connected

Towards minimum k-geodetically connected graphs

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

Minimum augmentation of a tree to a K-ed

Minimum augmentation of a tree to a K-edge-connected graph

✍ Shuichi Ueno; Yoji Kajitani; Hajime Wada 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 328 KB

The number of vertices of degree k in a

The number of vertices of degree k in a minimally k-edge-connected digraph

✍ Yuan Xu-dong; Kang Liying; Cai Mao-cheng 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 298 KB 👁 2 views

Let k be a positive integer, and D = (V (D), E(D)) be a minimally k-edge-connected simple digraph. We denote the outdegree and indegree of x ∈ V (D) by δ D (x) and ρ D (x), respectively. Let u + (D) denote the number of vertices W. Mader asked the following question in [Mader, in Paul Erdös is Eigh

An algorithm for construction of a k-con

An algorithm for construction of a k-connected graph with minimum number of edges and quasiminimal diameter

✍ Ulrich Schumacher 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 470 KB

Two fundamental considerations in the design of a communication network are reliability and maximum transmission delay. In this paper we give an algorithm for construction of an undirected graph with n vertices in which there are k node-disjoint paths between any two nodes. The generated graphs will