𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Graphs with degrees from prescribed intervals

✍ Scribed by Michael Koren

Publisher
Elsevier Science
Year
1976
Tongue
English
Weight
979 KB
Volume
15
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

Necessary 2nd sufficient corMions from presaibed intervals, are giw~ for the existence degrees

πŸ“œ SIMILAR VOLUMES

Bounded degrees and prescribed distances
Bounded degrees and prescribed distances in graphs
✍ Yair Caro; Zsolt Tuza πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 455 KB

Let X = {x1, ., x,,,} and Y= { J'~,. ,y,,\_} be two disjoint sets of vertices in a graph G. Then (X, Y) is called an antipodal set-pair ofsize m (m-ASP, for short) if the distance of xi and yj is at most two if and only if i #j. We prove that in a graph of maximum degree k every m-ASP has size m < k

The orders of graphs with prescribed deg
The orders of graphs with prescribed degree sets
✍ Timothy A. Sipka πŸ“‚ Article πŸ“… 1980 πŸ› John Wiley and Sons 🌐 English βš– 321 KB πŸ‘ 1 views

## Abstract 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__.

Total interval number for graphs with bo
Total interval number for graphs with bounded degree
✍ Kostochka, Alexander V.; West, Douglas B. πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 90 KB πŸ‘ 2 views

The total interval number of an n-vertex graph with maximum degree βˆ† is at most (βˆ†+1/βˆ†)n/2, with equality if and only if every component of the graph is K βˆ†,βˆ† . If the graph is also required to be connected, then the maximum is βˆ†n/2 + 1 when βˆ† is even, but when βˆ† is odd it exceeds [βˆ† + 1/(2.5βˆ† + 7.7