Premium
The orders of graphs with prescribed degree sets
Author(s) -
Sipka Timothy A.
Publication year - 1980
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.3190040308
Subject(s) - mathematics , combinatorics , degree (music) , graph , discrete mathematics , set (abstract data type) , independent set , order (exchange) , computer science , physics , acoustics , programming language , finance , economics
The degree set G of a graph G is the set of degrees of the vertices of G. For a finite nonempty set S of positive integers, all positive integers p are determined for which there exists a graph G of order p such that G = S .
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom