✦ LIBER ✦

Super edge- and point-connectivities of the Cartesian product of regular graphs

✍ Scribed by Bih-Sheue Shieh

Publisher: John Wiley and Sons
Year: 2002
Tongue: English
Weight: 114 KB
Volume: 40
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.10037

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On super edge-connectivity of Cartesian

On super edge-connectivity of Cartesian product graphs

✍ Min Lü; Guo-Liang Chen; Jun-Ming Xu 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 137 KB

On super connectivity of Cartesian produ

On super connectivity of Cartesian product graphs

✍ Min Lü; Chao Wu; Guo-Liang Chen; Cheng Lv 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 176 KB

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

The number of connected sparsely edged g

The number of connected sparsely edged graphs. II. Smooth graphs and blocks

✍ E. M. Wright 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 215 KB

A smooth graph is a connected graph without endpoints; f (n, q ) is the number of connected graphs, v(n, q ) is the number of smooth graphs, and u(n, q) is the number of blocks on n labeled points and q edges: wk, V,, and u k are the exponential generating functions of f(n, n + k ) , v(n, n + k). an

The generalized acyclic edge chromatic n

The generalized acyclic edge chromatic number of random regular graphs

✍ Stefanie Gerke; Catherine Greenhill; Nicholas Wormald 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 224 KB 👁 1 views

## Abstract The __r__‐acyclic edge chromatic number of a graph is defined to be the minimum number of colors required to produce an edge coloring of the graph such that adjacent edges receive different colors and every cycle __C__ has at least min(|__C__|, __r__) colors. We show that (__r__ − 2)__d

On the Edge Connectivity, Hamiltonicity,

On the Edge Connectivity, Hamiltonicity, and Toughness of Vertex-Transitive Graphs

✍ Jan van den Heuvel; Bill Jackson 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 191 KB

Let G be a connected k-regular vertex-transitive graph on n vertices. For S V(G) let d(S) denote the number of edges between S and V(G)"S. We extend results of Mader and Tindell by showing that if d(S)< 2 9 (k+1) 2 for some S V(G) with 1 3 (k+1) |S| 1 2 n, then G has a factor F such that GÂE(F ) is