𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Upper bound on the number of complete maps

✍ Scribed by I. N. Kovalenko

Publisher
Springer US
Year
1996
Tongue
English
Weight
177 KB
Volume
32
Category
Article
ISSN
1573-8337

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Bounds on the number of complete subgrap
Bounds on the number of complete subgraphs
✍ David C. Fisher; Jennifer Ryan πŸ“‚ Article πŸ“… 1992 πŸ› Elsevier Science 🌐 English βš– 385 KB

Fisher, D.C. and J. Ryan, Bounds on the number of complete subgraphs, Discrete Mathematics 103 (1992) 313-320. Let G be a graph with a clique number w. For 1 s s w, let k, be the number of complete j subgraphs on j nodes. We show that k,,, c (j~l)(kj/(~))u""'. This is exact for complete balanced w-

Upper bounds on the paired-domination nu
Upper bounds on the paired-domination number
✍ Xue-gang Chen; Wai Chee Shiu; Wai Hong Chan πŸ“‚ Article πŸ“… 2008 πŸ› Elsevier Science 🌐 English βš– 199 KB

A set S of vertices in a graph G is a paired-dominating set of G if every vertex of G is adjacent to some vertex in S and the subgraph induced by S contains a perfect matching. The minimum cardinality of a paired-dominating set of G is the paireddomination number of G, denoted by Ξ³ pr (G). In this w