Abstract
Graph editing problems ask whether an input graph can be modified to a graph with a given property by inserting and deleting vertices and edges. We consider the problem Graph Edit to NDL, which asks whether a graph can be modified to a graph with a given neighbourhood degree list (NDL) using at most \(\ell \) graph edits. The NDL lists the degrees of the neighbours of vertices in a graph, and is a stronger invariant than the degree sequence, which lists the degrees of vertices. In fact, the degree sequence of a graph is determined by its NDL.
Full Text
Submitted Version (
Free)
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call