✦ LIBER ✦

Semi-cartesian product of graphs

✍ Scribed by Metsidik, Metrose

Book ID: 125363964
Publisher: Springer
Year: 2013
Tongue: English
Weight: 221 KB
Volume: 52
Category: Article
ISSN: 0259-9791
DOI: 10.1007/s10910-013-0297-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Panconnectivity of Cartesian product gra

Panconnectivity of Cartesian product graphs

✍ You Lu; Jun-Ming Xu 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 352 KB

Regular embeddings of Cartesian product

Regular embeddings of Cartesian product graphs

✍ Jun-Yang Zhang 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 224 KB

The partition dimension of strong produc

The partition dimension of strong product graphs and Cartesian product graphs

✍ González Yero, Ismael; Jakovac, Marko; Kuziak, Dorota; Taranenko, Andrej 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 515 KB

Gromov hyperbolicity in Cartesian produc

Gromov hyperbolicity in Cartesian product graphs

✍ Junior Michel; José M. Rodríguez; José M. Sigarreta; María Villeta 📂 Article 📅 2010 🏛 Indian Academy of Sciences 🌐 English ⚖ 208 KB

Weak k-reconstruction of cartesian produ

Weak k-reconstruction of cartesian product graphs

✍ Wilfried Imrich; Blaž Zniazek; Janez Zerovnik 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 203 KB

Game coloring the Cartesian product of g

Game coloring the Cartesian product of graphs

✍ Xuding Zhu 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 186 KB

## Abstract This article proves the following result: Let __G__ and __G__′ be graphs of orders __n__ and __n__′, respectively. Let __G__^\*^ be obtained from __G__ by adding to each vertex a set of __n__′ degree 1 neighbors. If __G__^\*^ has game coloring number __m__ and __G__′ has acyclic chromat