Constructing bounded degree graphs with prescribed degree and neighbor degree sequences

TL;DR

This paper investigates the problem of constructing graphs with prescribed degree and neighbor degree sequences, providing polynomial-time solutions under bounded degree conditions, motivated by applications in NMR spectroscopy of hydrocarbons.

Contribution

It introduces polynomial-time algorithms for constructing various types of graphs with given degree and neighbor degree sequences when maximum degree is bounded.

Findings

Polynomial-time algorithms for graph construction problems.

Feasibility of constructing graphs with prescribed sequences under bounded degree.

Application relevance to NMR spectroscopy of hydrocarbons.

Abstract

Let $D = d_1, d_2, \ldots, d_n$ and $F = f_1, f_2,\ldots, f_n$ be two sequences of positive integers. We consider the following decision problems: is there a $i)$ multigraph, $ii)$ loopless multigraph, $iii)$ simple graph, $iv)$ connected simple graph, $v)$ tree, $vi)$ caterpillar $G = (V,E)$ such that for all $k$, $d(v_k) = d_k$ and $\sum_{w\in \mathcal{N}(v_k)} d(w) = f_k$ ($d(v)$ is the degree of $v$ and $\mathcal{N}(v)$ is the set of neighbors of $v$). Here we show that all these decision problems can be solved in polynomial time if $\max_{k} d_k$ is bounded. The problem is motivated by NMR spectroscopy of hydrocarbons.