๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Convex domination in the composition and cartesian product of graphs

โœ Scribed by Labendia, Mhelmar A.; Canoy, Sergio R.

Book ID
118797808
Publisher
Springer
Year
2012
Tongue
English
Weight
102 KB
Volume
62
Category
Article
ISSN
0011-4642

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Characterization of the cartesian produc
Characterization of the cartesian product of complete graphs by convex subgraphs
โœ Yoshimi Egawa ๐Ÿ“‚ Article ๐Ÿ“… 1986 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 115 KB

We show that if G is a connected graph with the same proper convex subgraphs as (Kn)', the Cartesian product of r copies of Kn, r >t 2, n >t 3, then [V(G)I ~> n" with equality if and only if G is isomorphic to (Kn)'. In this note we consider only connected finite undirected simple graphs. The compl

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