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 April 2, 2025)
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.
Forced Edges and Graph Structure
Published
Author(s)
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
Pub Type
NIST Pubs
Download Paper
Keywords
degree sequence, forced edge, forbidden edge
Citation
Issues
If you have any questions about this publication or are having problems accessing it, please contact reflib@nist.gov.
Created November 19, 2019, Updated January 19, 2020