✦ LIBER ✦

Connected Resolvability of Graphs

✍ Scribed by Varaporn Saenpholphat; Ping Zhang

Book ID: 111577358
Publisher: Springer
Year: 2003
Tongue: English
Weight: 199 KB
Volume: 53
Category: Article
ISSN: 0011-4642
DOI: 10.1023/b:cmaj.0000024524.43125.cd

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Resolvability in circulant graphs

✍ Muhammad Salman, Imran Javaid, Muhammad Anwar Chaudhry 📂 Article 📅 2012 🏛 Institute of Mathematics, Chinese Academy of Scien 🌐 English ⚖ 248 KB

Resolvability and the upper dimension of

Resolvability and the upper dimension of graphs

✍ G. Chartrand; C. Poisson; P. Zhang 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 832 KB

For an ordered set W = (~1, ~2,. , wk} of vertices and a vertex 2) in a connected graph G, the (metric) representation of v with respect to W is the /c-vector T(V 1 W) = (d(v,wl), d(v, wz), , d(v, wk)), where d(z, y) represents the distance between the vertices z and y. The set IV is a resolving set

Path connected graphs

✍ R. J. Faudree; R. H. Schelp 📂 Article 📅 1974 🏛 Akadmiai Kiad 🌐 English ⚖ 467 KB

Hamiltonian-connected graphs

✍ Zhao Kewen; Hong-Jian Lai; Ju Zhou 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 258 KB

Resolvability vs. almost resolvability

✍ István Juhász; Saharon Shelah; Lajos Soukup 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 128 KB

All 4-connected Line Graphs of Claw Free

All 4-connected Line Graphs of Claw Free Graphs Are Hamiltonian Connected

✍ Matthias Kriesell 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 109 KB

Thomassen conjectured that every 4-connected line graph is hamiltonian. Here we shall see that 4-connected line graphs of claw free graphs are hamiltonian connected.