✦ LIBER ✦

On the Smallest Disconnecting Set in a Graph

✍ Scribed by Boesch, F.; Frisch, I.

Book ID: 120538696
Publisher: Institute of Electrical and Electronics Engineers
Year: 1968
Tongue: English
Weight: 382 KB
Volume: 15
Category: Article
ISSN: 0018-9324
DOI: 10.1109/TCT.1968.1082832

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the smallest sets blocking simple per

On the smallest sets blocking simple perfect matchings in a convex geometric graph

✍ Chaya Keller; Micha A. Perles 📂 Article 📅 2012 🏛 The Hebrew University Magnes Press 🌐 English ⚖ 283 KB

The smallest basically disconnected prei

The smallest basically disconnected preimage of a space

✍ J. Vermeer 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 911 KB

Graphs with the smallest number of minim

Graphs with the smallest number of minimum cut sets

✍ Derek Smith 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 630 KB

A Note on Disconnected Weaklyk-Homogeneo

A Note on Disconnected Weaklyk-Homogeneous Graphs

✍ Gek Ling Chia; Wai Keong Kok 📂 Article 📅 2002 🏛 Springer Japan 🌐 English ⚖ 107 KB

Drawing Disconnected Graphs on the Klein

Drawing Disconnected Graphs on the Klein Bottle

✍ Laurent Beaudou; Antoine Gerbaud; Roland Grappe; Frédéric Palesi 📂 Article 📅 2010 🏛 Springer Japan 🌐 English ⚖ 140 KB

On smallest regular graphs with a given

On smallest regular graphs with a given isopart

✍ John Frederick Fink 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 408 KB 👁 1 views

## Abstract For a nonempty graph, G, we define p(G) and r(G) to be respectively the minimum order and minimum degree of regularity among all connected regular graphs __H__ having a nontrivial decomposition into subgraphs isomorphic to G. By f(G), we denote the least integer t for which there is a c