Graphs with degree sets of maximal cardinality: a handshaking problem revisited

DOI10.1080/002073901300037780zbMath1006.05035OpenAlexW2058601182MaRDI QIDQ3150430

Diane M. Spresser

Publication date: 17 October 2002

Published in: International Journal of Mathematical Education in Science and Technology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/002073901300037780

zbMATH Keywords

recursive algorithm

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Cites Work

• A discrete mathematical model for solving a handshaking problem and proving its correctness
• Another handshaking problem: graphs of orderpwhose degree sets containp —1 elements

This page was built for publication: Graphs with degree sets of maximal cardinality: a handshaking problem revisited