✦ LIBER ✦

Resolvability in circulant graphs

✍ Scribed by Muhammad Salman, Imran Javaid, Muhammad Anwar Chaudhry

Book ID: 118792058
Publisher: Institute of Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society
Year: 2012
Tongue: English
Weight: 248 KB
Volume: 28
Category: Article
ISSN: 1439-7617
DOI: 10.1007/s10114-012-0417-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Connected Resolvability of Graphs

✍ Varaporn Saenpholphat; Ping Zhang 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 199 KB

Max-cut in circulant graphs

✍ Svatopluk Poljak; Daniel Turzík 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 784 KB

Efficient domination in circulant graphs

✍ Reji Kumar, K.; MacGillivray, Gary 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 210 KB

PRODUCTS OF CIRCULANT GRAPHS

✍ Broere, Izak; Hattingh, Johannes H. 📂 Article 📅 1990 🏛 Taylor and Francis Group 🌐 English ⚖ 698 KB

Star Extremal Circulant Graphs

✍ Lih, Ko-Wei; Liu, Daphne Der-Fen; Zhu, Xuding 📂 Article 📅 1999 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 284 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