Non-isomorphic graphs with common degree sequences
Abstract
For all positive even integers n, graphs of order n with degree sequence equation* Sn:1,2,…,n/2,n/2,n/2+1,n/2+2,…,n-1 equation* naturally arose in the study of a labeling problem in IMO. This fact motivated the authors of the aforementioned paper to study these sequences and as a result of this study they proved that there is a unique graph of order n realizing Sn for every even integer n. The main goal of this paper is to generalize this result.
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.