𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the Existence of Graphs with Prescribed Degrees and Connectivity

✍ Scribed by S. L. Hakimi

Book ID
124180589
Publisher
Society for Industrial and Applied Mathematics
Year
1974
Tongue
English
Weight
956 KB
Volume
26
Category
Article
ISSN
0036-1399

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

Realizability of p-point graphs with pre
Realizability of p-point graphs with prescribed minimum degree, maximum degree, and line connectivity
✍ F. T. Boesch; C. L. Suffel πŸ“‚ Article πŸ“… 1980 πŸ› John Wiley and Sons 🌐 English βš– 316 KB

## Abstract It is well known that certain graph‐theoretic extremal questions play a central role in the study of communication network vulnerability. Herein we consider a generalization of some of the classical results in this area. We define a (__p__, Ξ”, Ξ΄, Ξ») graph as a graph having __p__ points,