Graph realizations: Maximum degree in vertex neighborhoods

Amotz Bar-Noy, Keerti Choudhary, David Peleg, Dror Rawitz

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

5 Scopus citations


The classical problem of degree sequence realizability asks whether or not a given sequence of n positive integers is equal to the degree sequence of some n-vertex undirected simple graph. While the realizability problem of degree sequences has been well studied for different classes of graphs, there has been relatively little work concerning the realizability of other types of information profiles, such as the vertex neighborhood profiles. In this paper, we initiate the study of neighborhood degree profiles, wherein, our focus is on the natural problem of realizing maximum neighborhood degrees. More specifically, we ask the following question: “Given a sequence D of n non-negative integers 0 ≤ d1 ≤ · · · ≤ dn, does there exist a simple graph with vertices v1, . . ., vn such that for every 1 ≤ i ≤ n, the maximum degree in the neighborhood of vi is exactly di?” We provide in this work various results for maximum-neighborhood-degree for general n vertex graphs. Our results are first of its kind that studies extremal neighborhood degree profiles. For closed as well as open neighborhood degree profiles, we provide a complete realizability criteria. We also provide tight bounds for the number of maximum neighbouring degree profiles of length n that are realizable. Our conditions are verifiable in linear time and our realizations can be constructed in polynomial time.

Original languageEnglish
Title of host publication17th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2020
EditorsSusanne Albers
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN (Electronic)9783959771504
StatePublished - 1 Jun 2020
Event17th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2020 - Torshavn, Faroe Islands
Duration: 22 Jun 202024 Jun 2020

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
ISSN (Print)1868-8969


Conference17th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2020
Country/TerritoryFaroe Islands

Bibliographical note

Publisher Copyright:
© Amotz Bar-Noy, Keerti Choudhary, David Peleg, and Dror Rawitz; licensed under Creative Commons License CC-BY


  • Extremum-degree
  • Graph realization
  • Neighborhood profile


Dive into the research topics of 'Graph realizations: Maximum degree in vertex neighborhoods'. Together they form a unique fingerprint.

Cite this