𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The codiameter of a 2-connected graph

✍ Scribed by Pei Wang; Xuezheng Lv

Book ID
108113792
Publisher
Elsevier Science
Year
2008
Tongue
English
Weight
193 KB
Volume
308
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Codiameters of 3-connected 3-domination
Codiameters of 3-connected 3-domination critical graphs
✍ Yaojun Chen; Feng Tian; Bing Wei πŸ“‚ Article πŸ“… 2001 πŸ› John Wiley and Sons 🌐 English βš– 110 KB

## Abstract A graph __G__ is 3‐domination critical if its domination number Ξ³ is 3 and the addition of any edge decreases Ξ³ by 1. Let __G__ be a 3‐connected 3‐domination critical graph of order __n__. In this paper, we show that there is a path of length at least __n__βˆ’2 between any two distinct ve

The Connectivities of Leaf Graphs of 2-C
The Connectivities of Leaf Graphs of 2-Connected Graphs
✍ Atsushi Kaneko; Kiyoshi Yoshimoto πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 286 KB

Given a connected graph G, denote by V the family of all the spanning trees of G. Define an adjacency relation in V as follows: the spanning trees t and t$ are said to be adjacent if for some vertex u # V, t&u is connected and coincides with t$&u. The resultant graph G is called the leaf graph of G.

Hamiltonian properties of the cube of a
Hamiltonian properties of the cube of a 2-edge connected graph
✍ M. Paoli πŸ“‚ Article πŸ“… 1988 πŸ› John Wiley and Sons 🌐 English βš– 514 KB

Let G be a 2-edge connected graph with a t least 5 vertices. For any given vertices a, b, c, and din G with a # b, there exists in G3 a hamiltonian path with endpoints a and b avoiding the edge cd, and there exists in G3 U {cd} a hamiltonian path with endpoints a and b and containing the edge cd. Al