## Abstract A __k__‐decomposition (__G__~1~,…,__G~k~__) of a graph __G__ is a partition of its edge set to form __k__ spanning subgraphs __G__~1~,…,__G~k~__. The classical theorem of Nordhaus and Gaddum bounds χ(__G__~1~) + χ(__G__~2~) and χ(__G__~1~)χ(__G__~2~) over all 2‐decompositions of __K~n~_
Some nordhaus-- gaddum-type results
✍ Scribed by Wayne Goddard; Michael A. Henning; Henda C. Swart
- Publisher
- John Wiley and Sons
- Year
- 1992
- Tongue
- English
- Weight
- 500 KB
- Volume
- 16
- Category
- Article
- ISSN
- 0364-9024
No coin nor oath required. For personal study only.
✦ Synopsis
Abstract
A Nordhaus‐‐Gaddum‐type result is a (tgiht) lower or upper bound on the sum or product of a parameter of a graph and its complement. In this paper some variations are considered. First, the sums and products of ψ(G~1~) and ψ(G~2~) are examined where G~1~ ⊕ G~2~ = K(s, s), and ψ is the independence, domination, or independent domination number, inter alia. In particular, it is shown that the maximum value of the product of the domination numbers of G~1~ and G~2~ is [(s/2 + 2)^2^] for s ≥ 3. Thereafter it is shown that for H~1~ ⊕ H~2~ ⊕ H~3~ = K~p~, the maximum product of the domination numbers of H~2~, H~2~, and H~3~ is p^3^/27 + Θ(p^2^).
📜 SIMILAR VOLUMES
A digraph G = (V, E) is primitive if, for some positive integer k, there is a u → v walk of length k for every pair u, v of vertices of V . The minimum such k is called the exponent of G, denoted exp(G). The exponent of a vertex u ∈ V , denoted exp(u), is the least integer k such that there is a u →
## Abstract We define the set of double complemented elements in BL‐algebras and state and prove some theorems which determines properties of these sets. We introduce the notion of an almost top element and study the properties of these elements (© 2009 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)