On the least size of a graph with a given degree set

DOI10.1016/J.DAM.2006.04.003zbMath1110.05024OpenAlexW2026066853MaRDI QIDQ860412

Sujith Vijay, Amitabha Tripathi

Publication date: 9 January 2007

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2006.04.003

zbMATH Keywords

degree sequencegraphic sequence

Mathematics Subject Classification ID

Vertex degrees (05C07)

Related Items (7)

A short proof of a theorem on degree sets of graphs ⋮ On size, order, diameter and minimum degree ⋮ Exact and approximate results on the least size of a graph with a given degree set ⋮ On degree sets and the minimum orders in bipartite graphs ⋮ On size, order, diameter and edge-connectivity of graphs ⋮ Tripartite graphs with given degree set ⋮ On degree sets in \(k\)-partite graphs

Cites Work

• Unnamed Item
• A note on a theorem of Erdős and Gallai
• A remark on the existence of finite graphs
• On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
• Degree sets for graphs

This page was built for publication: On the least size of a graph with a given degree set