Havel-Hakimi residues of unigraphs

DOI10.1016/J.IPL.2011.10.011zbMATH Open1232.05057OpenAlexW2003050176WikidataQ130474164 ScholiaQ130474164MaRDI QIDQ763488FDOQ763488

Authors: Michael D. Barrus 

Publication date: 9 March 2012

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2011.10.011

Recommendations

• Independence and the Havel-Hakimi residue
• Decomposition of graphical sequences and unigraphs
• On the residue of a graph
• On the \(k\)-residue of disjoint unions of graphs with applications to \(k\)-independence
• Graphs with the strong Havel-Hakimi property

zbMATH Keywords

combinatorial problemsindependence numbercanonical decompositionresidueHavel-Hakimi algorithmunigraph

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Vertex degrees (05C07)

Cites Work

• On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
• Decomposition of graphical sequences and unigraphs
• A remark on the existence of finite graphs
• Title not available (Why is that?)
• On the residue of a graph
• Degree sequences of graphs and dominance order
• Independence and the Havel-Hakimi residue
• Semi-regular graphs of minimum independence number

Cited In (3)

• On zero-error codes produced by greedy algorithms
• Graphs with the strong Havel-Hakimi property
• On the \(k\)-residue of disjoint unions of graphs with applications to \(k\)-independence

This page was built for publication: Havel-Hakimi residues of unigraphs

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