𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Non-Separated Cuttings of Connected Point Sets

✍ Scribed by G. T. Whyburn


Book ID
125664600
Publisher
American Mathematical Society
Year
1931
Tongue
English
Weight
898 KB
Volume
33
Category
Article
ISSN
0002-9947

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Connectivity and separating sets of cage
✍ Jiang, Tao; Mubayi, Dhruv πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 245 KB

A (k; g)-cage is a graph of minimum order among k-regular graphs with girth g. We show that for every cutset S of a (k; g)-cage G, the induced subgraph G[S] has diameter at least g/2 , with equality only when distance g/2 occurs for at least two pairs of vertices in G[S]. This structural property is