ABSTRACT
Networks are typically built in the real world by connecting smaller networks together to form larger ones. For example, two or more individual machines connected on a hub or a switch form a personal area network. A campus area network (CAN) connects two or more local area networks (LAN) and is limited to a specific and contiguous geographical area such as a college campus, industrial complex, or a military base. A metropolitan area network connects two or more LANs or CANs together and is limited to the geographical bounds of a city. The chapter highlights several binary operations on graphs that appear in the literature and tabulates the diameter and the vertex and edge vulnerability of graphs resulting from these operations. Binary operations on graphs have proven useful in many problem areas. The extensive literature on product-based architectures such as hypercube, meshes of trees, butterflies, and cube connected cycles document this claim.
