𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Hamilton-connectivity of 3-Domination Critical Graphs with α = δ  +  2

✍ Scribed by Yaojun Chen; Feng Tian; Yunqing Zhang


Publisher
Elsevier Science
Year
2002
Tongue
English
Weight
208 KB
Volume
23
Category
Article
ISSN
0195-6698

No coin nor oath required. For personal study only.

✦ Synopsis


A graph G is 3-domination critical if its domination number γ is 3 and the addition of any edge decreases γ by 1. It was proved by Favaron et al. that α ≤ δ + 2 for any connected 3-domination critical graph. Denote by τ (G) the toughness of a graph G. Recently Chen et al. conjectured that a connected 3-domination critical graph G is Hamilton-connected if and only if τ (G) > 1 and showed the conjecture is true when α ≤ δ. In this paper, by using a closure operation defined by Bondy and Chvátal, we show the conjecture is true when α = δ + 2.


📜 SIMILAR VOLUMES


Critical behaviour of { water  +&#x
✍ Xue-Qin An; You-Guo Huang; Wei-Guo Shen 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 120 KB

Coexistence curves of (T, n), (T, ϕ), and (T, ), where n, ϕ, and are the refractive index, volume fraction and effective volume fraction respectively, for ternary microemulsion systems of {water + n-nonane + sodium di(2ethyl-1-hexyl)sulphosuccinate} have been determined at temperatures within 8.7 K

Moufang Loops of Odd Orderpαq21 ···
✍ Fook Leong; Andrew Rajah 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 209 KB

Let L be a Moufang loop of odd order p ␣ q ␣ 1 иии q ␣ n where p and q are primes 1 n i with 3 F pq -иииq and ␣ F 2. In this paper, we prove that L is a group Ž . if p and q are primes with 3 F pq -иииq : i ␣ F 3, or ii ␣ F 4, p G 5.

Excess molar enthalpies and excess molar
✍ P. Santana; J. Balseiro; J. Salgado; E. Jiménez; J.L. Legido; L. Romanı́; M.I. P 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 139 KB

TABLE 1. Densities ρ for the pure liquids at T = 298.15 K Liquid ρ/(g • cm -3 ) expt lit 1-Cholorooctane 0.86875 0.86876 (4) 1-Butanol 0.80575 0.80576

A (2 + ε)-Approximation Scheme
✍ Mirela Damian-Iordache; Sriram V. Pemmaraju 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 249 KB

The main result of this paper is a (2 + ε)-approximation scheme for the minimum dominating set problem on circle graphs. We first present an O n 2 time 8-approximation algorithm for this problem and then extend it to an O n 3 + 6 ε n 6 ε +1 m time (2 + ε)-approximation scheme for this problem. Here