NOTICE: Due to a lapse in annual appropriations, most of this website is not being updated. Learn more.

Form submissions will still be accepted but will not receive responses at this time. Sections of this site for programs using non-appropriated funds (such as NVLAP) or those that are excepted from the shutdown (such as CHIPS and NVD) will continue to be updated.

U.S. flag

An official website of the United States government

Official websites use .gov
A .gov website belongs to an official government organization in the United States.

Secure .gov websites use HTTPS
A lock ( ) or https:// means you’ve safely connected to the .gov website. Share sensitive information only on official, secure websites.

PUBLICATIONS

Forced Edges and Graph Structure

Published

Author(s)

Brian D. Cloteaux

Abstract

For a degree sequence, its set of forced edges are the edges that appear in every realization of that sequence, while its forbidden edges appear in no realization. We examine sequences with forced or forbidden edges, showing relationships between these sequences, the structure of the forced or forbidden edge sets, and the resulting structural consequences to their realizations.
Citation
Journal of Research (NIST JRES) -
NIST Pub Series
Journal of Research (NIST JRES)
Pub Type
NIST Pubs

Download Paper

DOI Link

Keywords

degree sequence, forced edge, forbidden edge
Modeling and simulation research

Citation

Cloteaux, B. (2019), Forced Edges and Graph Structure, Journal of Research (NIST JRES), National Institute of Standards and Technology, Gaithersburg, MD, [online], https://doi.org/10.6028/jres.124.022 (Accessed October 9, 2025)

Issues

If you have any questions about this publication or are having problems accessing it, please contact [email protected].

Created November 19, 2019, Updated January 19, 2020
Was this page helpful?