Stiebitz, M., On Hadwiger's number-A problem of the Nordhaus-Gaddum type, Discrete Mathematics 101 (1992) 307-317. The Hadwiger number of a graph G = (V, E), denoted by q(G), is the maximum size of a complete graph to which G can be contracted. Let %((n, k):= {G 1 IV(G)1 = n and n(G) = k}. We shall
On a Nordhaus-Gaddum type problem for independent domination
β Scribed by E.J. Cockayne; G. Fricke; C.M. Mynhardt
- Publisher
- Elsevier Science
- Year
- 1995
- Tongue
- English
- Weight
- 254 KB
- Volume
- 138
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
β¦ Synopsis
Let i(G) (i(G), respectively) be the independent domination number (i.e. smallest cardinality of a maximal independent vertex subset) of the p-vertex graph G (the complement G of G, respectively).
We prove limp~[max~ i(G)i(Cr)/p 2] = 1/16.
π SIMILAR VOLUMES
## Abstract A singularly perturbed convectionβdiffusion problem in two and three space dimensions is discretized using the streamline upwind Petrov Galerkin (SUPG) variant of the finite element method. The dominant convection frequently gives rise to solutions with layers; hence anisotropic finite
The existence and uniqueness of a weak solution of a Neumann problem is discussed for a second-order quasilinear elliptic equation in a divergence form. The note is a continuation of a recent paper, where mixed boundary value problems were considered, which guaranteed the coerciveness of the problem