𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Construction of hamiltonian graphs and bigraphs with prescribed degrees

✍ Scribed by V Chungphaisan

Book ID
107884079
Publisher
Elsevier Science
Year
1978
Tongue
English
Weight
509 KB
Volume
24
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Constructing a bipartite graph of maximu
Constructing a bipartite graph of maximum connectivity with prescribed degrees
✍ Asano, Takao πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 328 KB πŸ‘ 3 views

d 2,n 2 ) is a bipartite graphical sequence, if there is a bipartite graph G with degrees {D 1 , D 2 } (i.e., G has two independent vertex sets In other words, {D 1 , D 2 } is a bipartite graphical sequence if and only if there is an n 1 1 n 2 matrix of 0's and 1's having d 1j 1 1's in row j 1 and