In graph theory, different types of product of two graphs have been studied, e.g. Cartesian product, Tensor product, Strong product, etc. Later on, Cartesian product and Tensor product have been generalized by 2-Cartesian product and 2-Tensor product. In this paper, we give one more generalize form, distance product of two graphs. Mainly we discuss the connectedness, bipartiteness and Eulerian property in this product.
Mehta, H. S. and Acharya, U. P.
Distance Product of Graphs,
Applications and Applied Mathematics: An International Journal (AAM), Vol. 13,
1, Article 13.
Available at: https://digitalcommons.pvamu.edu/aam/vol13/iss1/13