Signed degree sets in signed graphs

Simple item page
dc.creatorPirzada, S.
dc.creatorNaikoo, T. A.
dc.creatorDar, F. A.
dc.date2006-09-05
dc.date.accessioned2026-07-07T07:24:30Z
dc.date.available2026-07-07T07:24:30Z
dc.descriptionThe set D of distinct signed degrees of the vertices in a signed graph G is called its signed degree set. In this paper, we prove that every non-empty set of positive (negative) integers is the signed degree set of some connected signed graph and determine the smallest possible order for such a signed graph. We also prove that every non-empty set of integers is the signed degree set of some connected signed graph.
dc.identifierhttps://arxiv.org/abs/math/0609121
dc.identifierhttp://arxiv.org/abs/math/0609121
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/116379
dc.subjectCombinatorics
dc.titleSigned degree sets in signed graphs
dc.typetext

Files

Collections

arXiv