𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The strong distance problem on the Cartesian product of graphs

✍ Scribed by Justie Su-Tzu Juan; Chun-Ming Huang; I-fan Sun

Book ID
108154548
Publisher
Elsevier Science
Year
2008
Tongue
English
Weight
170 KB
Volume
107
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Strong perfectness of the generalized Ca
Strong perfectness of the generalized Cartesian product of graphs
✍ Maria KwaΕ›nik; Alina Szelecka πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 367 KB

In this paper we give a necessary and sufficient condition for the generalized Cartesian product to be strongly perfect. The special case of the result is the known theorem concerning the Cartesian product of two graphs.

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