Constructing bounded degree graphs with prescribed degree and neighbor degree sequences

Abstract

Let D = d 1 , d 2 , . . . , d n and F = f 1 , f 2 , . . . , f n be two sequences of positive integers. We consider the following decision problems: is there athe set of neighbors of v). Here we show that all these decision problems can be solvedThe problem is motivated by NMR spectroscopy of hydrocarbons.