Given a set δ = \ d₀ ,d₁ , ⋯ ,dn - 1 \ of positive integers and a positive integer p, the necessary and sufficient conditions are presented for existence of a p-connected n-vertex graph (which allows parallel edges but no self-loops) whose vertex degrees are d₀ ,d₁ , ⋯ ,dn - 1. Some related problems are discussed.
No takes yet. Share an insight, caveat, or question.
S. L. Hakimi (1974) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: