𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Extremal graphs with prescribed covering number

✍ Scribed by J.A Bondy

Publisher
Elsevier Science
Year
1978
Tongue
English
Weight
120 KB
Volume
24
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Extremal Regular Graphs with Prescribed
Extremal Regular Graphs with Prescribed Odd Girth
✍ G.H. Zhang πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 496 KB

The odd girth of a graph \(G\) gives the length of a shortest odd cycle in \(G\). Let \(f(k, g)\) denote the smallest \(n\) such that there exists a \(k\)-regular graph of order \(n\) and odd girth \(g\). It is known that \(f(k, g) \geqslant k g / 2\) and that \(f(k, g)=k g / 2\) if \(k\) is even. T

Regular graphs with prescribed chromatic
Regular graphs with prescribed chromatic number
✍ L. Caccetta; N. J. Pullman πŸ“‚ Article πŸ“… 1990 πŸ› John Wiley and Sons 🌐 English βš– 200 KB

## Abstract We determine the minimum number of edges in a regular connected graph on __n__ vertices, containing a complete subgraph of order __k__ ≀ __n__/2. This enables us to confirm and strengthen a conjecture of P. ErdΓΆs on the existence of regular graphs with prescribed chromatic number.

Characterization of graphs with equal do
Characterization of graphs with equal domination and covering number
✍ Bert Randerath; Lutz Volkmann πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 592 KB

Let G be a simple graph of order n(G). A vertex set D of G is dominating if every vertex not in D is adjacent to some vertex in D, and D is a covering if every edge of G has at least one end in D. The domination number 7(G) is the minimum order of a dominating set, and the covering number/~(G) is th