✦ LIBER ✦

A general class of invulnerable graphs

✍ Scribed by F. T. Boesch; A. P. Felzer

Publisher: John Wiley and Sons
Year: 1972
Tongue: English
Weight: 1004 KB
Volume: 2
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.3230020306

No coin nor oath required. For personal study only.

✦ Synopsis

The idea of u t i Z i z i n g the connectivity properties of a graph as measures of i t s vulnerability has been welZ docwnented. graph t h e o r e t i c concepts and the b a s i c resuZts of t h i s theory are r e v i m e d here. are defined and compared.

SpecificaZZy a class of graphs called teZescopicaZly non-contracting star polygons are shown to c o n s t i t u t e a rather general s e t of invuZnerabZe graphs. k w n optimal graphs considerab Zy.

The Various types of optimaZly invulnerable graphs

New resuZts are presented for the synthesis of optima2 graphs.

📜 SIMILAR VOLUMES

Orderly algorithms for generating restri

Orderly algorithms for generating restricted classes of graphs

✍ Charles J. Colbourn; Ronald C. Read 📂 Article 📅 1979 🏛 John Wiley and Sons 🌐 English ⚖ 463 KB

## Abstract Orderly algorithms for the generation of exhaustive lists of nonisomorphic graphs are discussed. The existence of orderly methods to generate the graphs with a given subgraph and without a given subgraph is established. This method can be used to list all the nonisomorphic subgraphs of

General Antifactors of Graphs

✍ A. Sebo 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 428 KB

In a superstitious company everybody has numbers that he thinks to be unlucky for himself. When they meet, everybody wants to shake hands with some of his acquaintances, but nobody wants to shake hands with an unlucky number of acquaintances. When can this be successful? This question occurred to L.

A class of upper-embeddable graphs

✍ F. Jaeger; C. Payan; N. H. Xuong 📂 Article 📅 1979 🏛 John Wiley and Sons 🌐 English ⚖ 202 KB

## Abstract In this paper, we prove the following result: Every graph obtained by connecting (with any number of edges) two vertex‐disjoint upper‐embeddable graphs graphs with even Betti number is upper‐embeddable.

A class of Hamiltonian regular graphs

✍ Paul Erdös; Arthur M. Hobbs 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 317 KB

## Abstract In this paper, we show that __n__ ⩾ 4 and if __G__ is a 2‐connected graph with 2__n__ or 2__n__−1 vertices which is regular of degree __n__−2, then __G__ is Hamiltonian if and only if __G__ is not the Petersen graph.

Constructing a Class of Symmetric Graphs

✍ Sanming Zhou 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 208 KB

We find a natural construction of a large class of symmetric graphs from point-and block-transitive 1-designs. The graphs in this class can be characterized as G-symmetric graphs whose vertex sets admit a G-invariant partition B of block size at least 3 such that, for any two blocks B, C of B, eithe

The n-ordered graphs: A new graph class

✍ Anthony Bonato; Jeannette Janssen; Changping Wang 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 147 KB

## Abstract For a positive integer __n__, we introduce the new graph class of __n__‐ordered graphs, which generalize partial __n__‐trees. Several characterizations are given for the finite __n__‐ordered graphs, including one via a combinatorial game. We introduce new countably infinite graphs __R__