Cartesian product of graphs

Introduction to Graph Theory

Published in Sriraman Sridharan, R. Balakrishnan, Foundations of Discrete Mathematics with Algorithms and Programming, 2019

Sriraman Sridharan, R. Balakrishnan

In this section, we study some basic operations on graphs. These include the union of graphs, join of graphs, Cartesian product of graphs, contraction of an edge of G and minor of a graph. These operations are defined here only for simple graphs but these definitions can be naturally extended to multigraphs and digraphs as well.

Cyclic vertex-connectivity of Cartesian product graphs

View Article

Journal Information

Published in International Journal of Parallel, Emergent and Distributed Systems, 2020

Dejin Qin, Yingzhi Tian, Laihuan Chen, Jixiang Meng

In the following, we use the same notations related to Cartesian product graph as in [28]. Let and , where and . The Cartesian product of graphs and , denoted by , is the graph with vertex set , and any two vertices and are adjacent if and only if either with or with .

Cartesian product of graphs

Explore chapters and articles related to this topic

Introduction to Graph Theory

Cyclic vertex-connectivity of Cartesian product graphs