𝔖 Bobbio Scriptorium
✦   LIBER   ✦

ON EXTREMAL GRAPHS WITH GIVEN DIAMETER AND CONNECTIVITY

✍ Scribed by Louis Caccetta

Book ID
118717493
Publisher
John Wiley and Sons
Year
1979
Tongue
English
Weight
794 KB
Volume
328
Category
Article
ISSN
0890-6564

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Graphs with given connectivity propertie
Graphs with given connectivity properties
✍ Lawrencenko, Serge; Luo, Qiang πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 98 KB

A node of a graph G, thought of as representing a communication network, is said to be redundant provided that its removal does not diminish the connectivity. In constructing networks, we require reliable connectedness in addition to the usual requirement of reliability (i.e., the higher the connect

On connectivity in graphs with given cli
On connectivity in graphs with given clique number
✍ Angelika Hellwig; Lutz Volkmann πŸ“‚ Article πŸ“… 2006 πŸ› John Wiley and Sons 🌐 English βš– 82 KB πŸ‘ 1 views

## Abstract We consider finite, undirected, and simple graphs __G__ of order __n__(__G__) and minimum degree Ξ΄(__G__). The connectivity ΞΊ(__G__) for a connected graph __G__ is defined as the minimum cardinality over all vertex‐cuts. If ΞΊ(__G__) < δ(__G__), then Topp and Volkmann 7 showed in 1993 f

Extremal graphs in connectivity augmenta
Extremal graphs in connectivity augmentation
✍ JordοΏ½n, Tibor πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 245 KB πŸ‘ 1 views

Let A(n, k, t) denote the smallest integer e for which every kconnected graph on n vertices can be made (k + t)-connected by adding e new edges. We determine A(n, k, t) for all values of n, k, and t in the case of (directed and undirected) edge-connectivity and also for directed vertex-connectivity