Degree Sequences for Graphs with Loops
Grant Cairns, Stacey Mendan · arXiv (Cornell University) · 2013
This paper considers graphs, without multiple edges, in which there is at most one loop at each vertex. We give Erdos--Gallai type theorems for such graphs and we show how they relate to bipartite graphs in which the two parts have the same degree sequence.