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

DOI10.1016/J.DAM.2006.04.003zbMATH Open1110.05024OpenAlexW2026066853MaRDI QIDQ860412FDOQ860412

S. 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

Recommendations

• Exact and approximate results on the least size of a graph with a given degree set
• Bipartite Graphs and their Degree Sets
• On the order of a graph with a given degree set
• Some remarks on degree sets of multigraphs
• A short proof of a theorem on degree sets of graphs

zbMATH Keywords

degree sequencegraphic sequence

Mathematics Subject Classification ID

Vertex degrees (05C07)

Cites Work

• Title not available (Why is that?)
• On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
• A note on a theorem of Erdős and Gallai
• A remark on the existence of finite graphs
• Degree sets for graphs

Cited In (11)

• On size, order, diameter and edge-connectivity of graphs
• Title not available (Why is that?)
• On degree sets and the minimum orders in bipartite graphs
• A short proof of a theorem on degree sets of graphs
• Title not available (Why is that?)
• On degree sets in \(k\)-partite graphs
• Title not available (Why is that?)
• Smallest Graphs Achieving the Stinson Bound
• Tripartite graphs with given degree set
• Exact and approximate results on the least size of a graph with a given degree set
• On size, order, diameter and minimum degree

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q860412)