✦ LIBER ✦

Graphs with given connectivity and independence number or networks with given measures of vulnerability and survivability

✍ Scribed by Amin, A.; Hakimi, S.

Book ID: 114614531
Publisher: Institute of Electrical and Electronics Engineers
Year: 1973
Tongue: English
Weight: 1017 KB
Volume: 20
Category: Article
ISSN: 0018-9324
DOI: 10.1109/tct.1973.1083622

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

On local connectivity of graphs with giv

On local connectivity of graphs with given clique number

✍ Andreas Holtkamp; Lutz Volkmann 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 72 KB

## Abstract For a vertex __v__ of a graph __G__, we denote by __d__(__v__) the __degree__ of __v__. The __local connectivity__ κ(__u, v__) of two vertices __u__ and __v__ in a graph __G__ is the maximum number of internally disjoint __u__ –__v__ paths in __G__, and the __connectivity__ of __G__ is

Nonseparable graphs with a given number

Nonseparable graphs with a given number of cycles

✍ Ranko Šćepanović; Gerhard Ringel; Dragan Marušič; G. L. Chia; Brian Alspach 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 646 KB

## Abstract G. Ringel conjectured that for every positive integer __n__ other than 2, 4, 5, 8, 9, and 16, there exists a nonseparable graph with __n__ cycles. It is proved here that the conjecture is true even with the restriction to planar and hamiltonian graphs.

Primitive graphs with given exponents an

Primitive graphs with given exponents and minimum number of edges

✍ Byeong Moon Kim; Byung Chul Song; Woonjae Hwang 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 364 KB

Extremal Graphs With a Given Number of P

Extremal Graphs With a Given Number of Perfect Matchings

✍ Stephen G. Hartke; Derrick Stolee; Douglas B. West; Matthew Yancey 📂 Article 📅 2012 🏛 John Wiley and Sons 🌐 English ⚖ 771 KB

The maximum interval number of graphs wi

The maximum interval number of graphs with given genus

✍ Edward R. Scheinerman 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 202 KB 👁 1 views

The interval number of a graph G, denoted i(G), is the least positive integer t such that G is the intersection graph of sets, each of which is the union of t compact real intervals. It is known that every planar graph has interval number at most 3 and that this result is best possible. We investiga