𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On super edge-connectivity of Cartesian product graphs

✍ Scribed by Min Lü; Guo-Liang Chen; Jun-Ming Xu

Publisher
John Wiley and Sons
Year
2007
Tongue
English
Weight
137 KB
Volume
49
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Super edge connectivity properties of co
Super edge connectivity properties of connected edge symmetric graphs
✍ Li, Qiaoliang; Li, Qiao 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 47 KB 👁 2 views

The super edge connectivity properties of a graph G can be measured by the restricted edge connectivity Ј(G). We evaluate Ј(G) and the number of i-cutsets C i (G), d Յ i Յ 2d Ϫ 3, explicitly for each d-regular edge-symmetric graph G. These results improve the previous one by R. Tindell on the same s

Sufficient conditions for graphs to be λ
Sufficient conditions for graphs to be λ′-optimal, super-edge-connected, and maximally edge-connected
✍ Angelika Hellwig; Lutz Volkmann 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 149 KB

## Abstract The restricted‐edge‐connectivity of a graph __G__, denoted by λ′(__G__), is defined as the minimum cardinality over all edge‐cuts __S__ of __G__, where __G__‐__S__ contains no isolated vertices. The graph __G__ is called λ′‐optimal, if λ′(__G__) = ξ(__G__), where ξ(__G__) is the minimum

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

Game coloring the Cartesian product of g
Game coloring the Cartesian product of graphs
✍ Xuding Zhu 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 186 KB

## Abstract This article proves the following result: Let __G__ and __G__′ be graphs of orders __n__ and __n__′, respectively. Let __G__^\*^ be obtained from __G__ by adding to each vertex a set of __n__′ degree 1 neighbors. If __G__^\*^ has game coloring number __m__ and __G__′ has acyclic chromat