✦ LIBER ✦

A new neighborhood condition for graphs to be fractional -deleted graphs

✍ Scribed by Sizhong Zhou

Book ID: 113449303
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 211 KB
Volume: 25
Category: Article
ISSN: 0893-9659
DOI: 10.1016/j.aml.2011.09.048

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

A new neighborhood union condition for H

A new neighborhood union condition for Hamiltonian graphs

✍ Wei Bing; Zhu Yongjin 📂 Article 📅 1997 🏛 Institute of Mathematics, Chinese Academy of Scien 🌐 English ⚖ 293 KB

Degree Conditions for Graphs to be Fract

Degree Conditions for Graphs to be Fractional (a,b,n)-Critical Graphs

✍ Jianxiang Li; Yinghong Ma 📂 Article 📅 2006 🏛 Academy of Mathematics and Systems Science, Chines 🌐 English ⚖ 166 KB

A neighborhood condition for graphs to b

A neighborhood condition for graphs to be maximally k-restricted edge connected

✍ Shiying Wang; Lei Zhang; Shangwei Lin 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 140 KB

A sufficient condition for graphs with l

A sufficient condition for graphs with large neighborhood unions to be traceable

✍ Shijun Ren 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 246 KB

We prove that a 2-connected graph G of order p is traceable if (u, v, w, x are distinct vertices of G). In addition, we give a short proof of Lindquester's conjecture.

Neighborhood conditions for graphs to be

Neighborhood conditions for graphs to be super restricted edge connected

✍ Shiying Wang; Jing Li; Lihong Wu; Shangwei Lin 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 212 KB

## Abstract Restricted edge connectivity is a more refined network reliability index than edge connectivity. For a connected graph __G__ = (__V__, __E__), an edge set __S__ ⊆ __E__ is a restricted edge cut if __G__ − __S__ is disconnected and every component of __G__ − __S__ has at least two vertic