✦ LIBER ✦

The communicability distance in graphs

✍ Scribed by Ernesto Estrada

Book ID: 113772250
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 634 KB
Volume: 436
Category: Article
ISSN: 0024-3795
DOI: 10.1016/j.laa.2012.01.017

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Distance in stratified graphs

✍ Gary Chartrand; Lisa Hansen; Reza Rashidi; Naveed Sherwani 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 536 KB

MONOPHONIC DISTANCE IN GRAPHS

✍ SANTHAKUMARAN, A. P.; TITUS, P. 📂 Article 📅 2011 🏛 World Scientific 🌐 English ⚖ 391 KB

The walk distances in graphs

✍ Pavel Chebotarev 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 340 KB

Distance in the curve graph

✍ Hamenstädt, Ursula 📂 Article 📅 2013 🏛 Springer 🌐 English ⚖ 182 KB

Graph similarity and distance in graphs

✍ G. Chartrand; G. Kubicki; M. Schultz 📂 Article 📅 1998 🏛 Springer 🌐 English ⚖ 427 KB

Distance graphs with missing multiples i

Distance graphs with missing multiples in the distance sets

✍ Liu, Daphne D.-F.; Zhu, Xuding 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 141 KB 👁 3 views

Given positive integers m, k, and s with m > ks, let D m,k,s represent the set {1, 2, . . . , m} -{k, 2k, . . . , sk}. The distance graph G(Z, D m,k,s ) has as vertex set all integers Z and edges connecting i and j whenever |i -j| ∈ D m,k,s . The chromatic number and the fractional chromatic number