Showing papers on "Cartesian product of graphs published in 2000"
Book•
14 Apr 2000
TL;DR: Basic Concepts.
Abstract: Basic Concepts. Hypercubes. Hamming Graphs. Cartesian Products. Strong and Direct Products. Lexicographic Products. Fast Recognition Algorithms. Invariants. Appendices. Bibliography. Indexes.
869 citations
TL;DR: It is proved thatgamma(G) is the domination number of a graph and H is the Cartesian product of graphs for all simple graphs and H.
Abstract: Let $\gamma(G)$ denote the domination number of a graph $G$ and let $G\square H$ denote the Cartesian product of graphs $G$ and $H$. We prove that $\gamma(G)\gamma(H) \le 2 \gamma(G\square H)$ for all simple graphs $G$ and $H$.
89 citations