Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 231,032,563 papers from all fields of science
Search
Sign In
Create Free Account
Digraph realization problem
The digraph realization problem is a decision problem in graph theory. Given pairs of nonnegative integers , the problem asks whether there is a…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
15 relations
Adjacency matrix
Bipartite realization problem
Contingency table
Decision problem
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
The Connection between the Number of Realizations for Degree Sequences and Majorization
A. Berger
arXiv.org
2012
Corpus ID: 279944
The \emph{graph realization problem} is to find for given nonnegative integers $a_1,\dots,a_n$ a simple graph (no loops or…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE