𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A sufficient condition for -path graphs being r-connected

✍ Scribed by C. Balbuena; P. García-Vázquez

Book ID
108112653
Publisher
Elsevier Science
Year
2007
Tongue
English
Weight
183 KB
Volume
155
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Sufficient conditions for a graph to be
Sufficient conditions for a graph to be super restricted edge-connected
✍ Shiying Wang; Shangwei Lin 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 236 KB

## Abstract Restricted edge connectivity is a more refined network reliability index than edge connectivity. A restricted edge cut __F__ of a connected graph __G__ is an edge cut such that __G__‐__F__ has no isolated vertex. The restricted edge connectivity λ′ is the minimum cardinality over all re

Sufficient conditions for maximally conn
Sufficient conditions for maximally connected dense graphs
✍ Terunao Soneoka; Hiroshi Nakada; Makoto Imase; Claudine Peyrat 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 764 KB

This paper considers the relations between the connectivity x or the edge-connectivity A of a graph and other parameters such as the number of vertices n, maximum degree A, minimum degree 6, diameter D and girth g. The following sufficient conditions for maximally connected graphs are derived. 6fir

A sufficient condition for graphs to be
A sufficient condition for graphs to be fractional -deleted graphs
✍ Sizhong Zhou 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 218 KB

graph a b s t r a c t Let G be a graph, and k a positive integer. Let h : E(G) → [0, 1] be a function. If ∑ e∋x h(e) = k holds for each x ∈ V (G), then we call G[F h ] a fractional k-factor of G with indicator function h where F h = {e ∈ E(G) : h(e) > 0}. A graph G is called a fractional (k, m)delet