𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Ends and Vertices of Small Degree in Infinite Minimally k -(Edge)-Connected Graphs

✍ Scribed by Stein, Maya

Book ID
118197858
Publisher
Society for Industrial and Applied Mathematics
Year
2010
Tongue
English
Weight
321 KB
Volume
24
Category
Article
ISSN
0895-4801

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The number of vertices of degree k in a
The number of vertices of degree k in a minimally k-edge-connected digraph
✍ Yuan Xu-dong; Kang Liying; Cai Mao-cheng πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 298 KB πŸ‘ 2 views

Let k be a positive integer, and D = (V (D), E(D)) be a minimally k-edge-connected simple digraph. We denote the outdegree and indegree of x ∈ V (D) by δ D (x) and ρ D (x), respectively. Let u + (D) denote the number of vertices W. Mader asked the following question in [Mader, in Paul Erdâs is Eigh

A remark on the number of vertices of de
A remark on the number of vertices of degree k in a minimally k-edge-connected graph
✍ Mao-cheng Cai πŸ“‚ Article πŸ“… 1992 πŸ› Elsevier Science 🌐 English βš– 395 KB

Let G be a minimally k-edge-connected simple graph and u\*(G) be the number of vertices of degree k in G. proved that (i) uk(G) 2 l(jGl -1)/(2k + l)] + k + 1 for even k, and (ii) uI(G) 2 [lGl/(k + l)] + k for odd k 35 and u,(G) 2 lZlGl/(k + l)] + k -2 for odd k 27, where ICI denotes the number of v