Search
Close this search box.

Contents

Journal of Combinatorial Mathematics and Combinatorial Computing

  • Research article

Some Remarks on Degree Sets of Multigraphs

Lutz Volkmann1
1Lehrstuhl II ftir Mathematik, RWTH Aachen University, 52056 Aachen, Germany
  • Published: 31/05/2010

Abstract

The degree set of a graph \( G \) is the set \( S \) consisting of the distinct degrees of vertices in \( G \). In 1977, Kapoor, Polimeni, and Wall \([2]\) determined the least number of vertices among simple graphs with a given degree set. In this note, we look at the analogue problem concerning the least order and the least size of a multigraph with a given degree set.

Keywords: degree set, degree sequence, multigraph 2000 Mathematics Subject Classification: 05C07
Information
Guidelines
CP Initiatives
Follow CP
Facebook X-twitter Linkedin
1970-2024 CP (Manitoba, Canada) unless otherwise stated.
Citation
Lutz Volkmann. Some Remarks on Degree Sets of Multigraphs[J], Journal of Combinatorial Mathematics and Combinatorial Computing, Volume 077. 45-49. DOI: .