The degree sequences of a graph with restrictions
Keyword(s):
<p>Two finite sequences <em>s</em><sub>1 </sub>and <em>s</em><sub>2</sub> of nonnegative integers are called bigraphical if there exists a bipartite graph <em>G</em> with partite sets <em>V</em><sub>1</sub> and <em>V</em><sub>2</sub> such that <em>s</em><sub>1</sub> and <em>s</em><sub>2</sub> are the degrees in <em>G </em>of the vertices in <em>V</em><sub>1</sub> and <em>V</em><sub>2</sub>, respectively. In this paper, we introduce the concept of <em>1</em>-graphical sequences and present a necessary and sufficient condition for a sequence to be <em>1</em>-graphical in terms of bigraphical sequences.</p>
2017 ◽
Vol E100.A
(12)
◽
pp. 2764-2775
◽