✦ LIBER ✦

Edge-Wide-Diameter of Graphs with Diameterd

✍ Scribed by Toru Kojima; Kiyoshi Ando; Atsushi Kaneko

Publisher: Springer
Year: 2002
Tongue: English
Weight: 97 KB
Volume: 6
Category: Article
ISSN: 0218-0006
DOI: 10.1007/s00026-002-8030-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Wide diameters of de Bruijn graphs

✍ Jyhmin Kuo; Hung-Lin Fu 📂 Article 📅 2007 🏛 Springer US 🌐 English ⚖ 288 KB

Graphs of diameter 3 with the minimum nu

Graphs of diameter 3 with the minimum number of edges

✍ Zoltán Füredi 📂 Article 📅 1990 🏛 Springer Japan 🌐 English ⚖ 231 KB

Note: The diameter of edge domination cr

Note: The diameter of edge domination critical graphs

✍ Matteo Paris 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 111 KB

On the fault-tolerant diameter and wide

On the fault-tolerant diameter and wide diameter of ω-connected graphs

✍ Jian-Hua Yin; Jiong-Sheng Li; Guo-Liang Chen; Cheng Zhong 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 179 KB

On the spanning w-wide diameter of the s

On the spanning w-wide diameter of the star graph

✍ Cheng-Kuan Lin; Hua-Min Huang; D. Frank Hsu; Lih-Hsing Hsu 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 402 KB

## Abstract Let __u__ and __v__ be any two distinct nodes of an undirected graph __G__, which is __k__‐connected. A container __C__(__u__,__v__) between __u__ and __v__ is a set of internally disjoint paths {__P__~1~,__P__~2~,…,__P__~__w__~} between __u__ and __v__ where 1 ≤ __w__ ≤ __k__. The widt

The maximum number of edges in a minimal

The maximum number of edges in a minimal graph of diameter 2

✍ Zoltán Füredi 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 717 KB

## Abstract A graph __g__ of diameter 2 is minimal if the deletion of any edge increases its diameter. Here the following conjecture of Murty and Simon is proved for __n__ < __n__~o~. If __g__ has __n__ vertices then it has at most __n__^2^/4 edges. The only extremum is the complete bipartite graph