Hostname: page-component-7b7567c8c-tnkh4 Total loading time: 0 Render date: 2026-11-17T10:56:40.349Z Has data issue: false hasContentIssue false

Some Properties of Graphs with Multiple Edges

Published online by Cambridge University Press:  20 November 2018

D. R. Fulkerson
Affiliation:
RAND Corporation and IBM Research Center
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

In this paper we consider undirected graphs, with no edges joining a vertex to itself, but with possibly several edges joining pairs of vertices. The first part of the paper deals with the question of characterizing those sets of non-negative integers d 1d 2 . . . , dn and {cij }, 1 ≤ i < j ≤ n, such that there exists a graph G with n vertices whose valences (degrees) are the numbers di , and with the additional property that the number of edges joining i and j is at most cij . This problem has been studied extensively, in the general case (1, 2, 9, 11), in the case where the graph is bipartite (3, 5, 7, 10), and in the case where the Cij are all 1 (6).

Information

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1965