Changing the Diameter of Graph Products

  • Authors:
  • Ting-Yi Sung;Jeng-Jung Wang

  • Affiliations:
  • -;-

  • Venue:
  • COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

Abstract

Graham and Harary [3]studied how the diameter of hypercubes can be affected by increasingand decreasingedg es. Since many networks are constructed by graph products, e.g., tori and meshes, in this paper we study how the diameter of graph products, particularly Cartesian product and Kronecker product, can be changed by adding and removal of edges. We study Cartesian products on paths, cycles, trees, and hypercubes. The diameter of the Kronecker product of two graphs is in general difficult to find. We in particular study the Kronecker product of two cycles.