𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Graphs and degree sequences. I

✍ Scribed by R. I. Tyshkevich; A. A. Chernyak; Zh. A. Chernyak

Publisher
Springer US
Year
1988
Tongue
English
Weight
984 KB
Volume
23
Category
Article
ISSN
1573-8337

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Degree sequences of graphs and dominance
Degree sequences of graphs and dominance order
✍ Triesch, Eberhard πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 271 KB πŸ‘ 2 views

Suppose that the graphical partition H(A) = (a: 2 . . . 2 a:) arises from A = (al 2 . . . 2 a,) by deleting the largest summand a1 from A and reducing the a1 largest of the remaining summands by one. Let (a;+l 2 . . 2 ah) = H ( A ) denote the partition obtained by applying the operator H i times. We

Signed degree sequences of signed graphs
Signed degree sequences of signed graphs
✍ Yan, Jing-Ho; Lih, Ko-Wei; Kuo, David; Chang, Gerard J. πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 105 KB πŸ‘ 2 views

sequence to be the signed degree sequence of a signed graph or a signed tree, answering a question raised by

Degree sequences in triangle-free graphs
Degree sequences in triangle-free graphs
✍ Paul ErdΕ‘s; Siemion Fajtlowicz; William Staton πŸ“‚ Article πŸ“… 1991 πŸ› Elsevier Science 🌐 English βš– 250 KB