Signed degree sets in signed graphs [article]

S. Pirzada, T. A. Naikoo, F. A. Dar
<span title="2006-09-05">2006</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
The 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.
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/math/0609121v1">arXiv:math/0609121v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/2kv2nl4bdjf7vjuus7tnv42eyq">fatcat:2kv2nl4bdjf7vjuus7tnv42eyq</a> </span>
<a target="_blank" rel="noopener" href="https://archive.org/download/arxiv-math0609121/math0609121.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> File Archive [PDF] </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/math/0609121v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>