Non-isomorphic graphs with common degree sequences

Authors Rikio Ichishima, F. A. Muntaner-Batle

Publication date 14 March 2023

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Vertex degrees (05C07) Graph operations (line graphs, products, etc.) (05C76)

Abstract: For all positive even integers

n

, graphs of order

n

with degree sequence �egin{equation*} S_{n}:1,2,dots,n/2,n/2,n/2+1,n/2+2,dots,n-1 end{equation*} naturally arose in the study of a labeling problem in cite{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

S_{n}

for every even integer

n

. The main goal of this paper is to generalize this result.

This page was built for publication: Non-isomorphic graphs with common degree sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6429461)