Diameter formulas for a class of undirected multi-loop networks

Abstract

Let n≥ 5 and m≥ 1 be positive integers. Let S = ( s1, s2, … , sm) be a sequence of integers such that 1 ≤ s1 < s2 < … < sm ≤ n-12 . In this paper, we discuss the diameter of multi-loop networks Cn(s1,s2, …, sm) when s1=1. We also present a relation between the diameter of multi-loop networks and the diameter of generalized Petersen graphs.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…