Article ID Journal Published Year Pages File Type
8941808 Discrete Applied Mathematics 2018 6 Pages PDF
Abstract
Let G and H be graphs, and G□H the Cartesian product of G and H. We prove that for every connected bridgeless graphs G and H, the Cartesian product G□H admits an orientation of diameter at most wdiammin(G)+wdiammin(H)+8, where wdiammin(G) denotes the minimum weak diameter of an orientation of G. Orientations of products of graphs that have bridges are considered as well, and an upper bound for the minimum diameter of such orientations is given.
Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics
Authors
,