Premium
Construction of a Maximally Edge‐Connected Graph with Prescribed Degrees
Author(s) -
Wang D. L.
Publication year - 1976
Publication title -
studies in applied mathematics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 46
eISSN - 1467-9590
pISSN - 0022-2526
DOI - 10.1002/sapm197655187
Subject(s) - combinatorics , mathematics , graph , disjoint sets , enhanced data rates for gsm evolution , sequence (biology) , discrete mathematics , computer science , telecommunications , biology , genetics
Let 〈 d 1 , d 2 ,..., d p ,〉 be a realizable degree sequence, d i ⩾2; then a graph G can be constructed so that deg( v i and so that for i ≠ j , the number of edge‐disjoint paths between v i and v j is ( d i , d j ).
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