## Abstract Given a graph __G__ with weighting __w__: __E__(__G__) ← __Z__^+^, the __Strength__ of __G__(__w__) is the maximum weight on any edge. The __sum__ of a vertex in __G__(__w__) is the sum of the weights of all its incident edges. The network __G__(__w__) is __irregular__ if the vertex sum
The domination numbers of the 5 × n and 6 × n grid graphs
✍ Scribed by Tony Yu Chang; W. Edwin Clark
- Publisher
- John Wiley and Sons
- Year
- 1993
- Tongue
- English
- Weight
- 745 KB
- Volume
- 17
- Category
- Article
- ISSN
- 0364-9024
No coin nor oath required. For personal study only.
✦ Synopsis
Abstract
The k × n grid graph is the product P~k~ × P~n~ of a path of length k − 1 and a path of length n − 1. We prove here formulas found by E. O. Hare for the domination numbers of P~5~ × P~n~ and P~6~ × P~n~. © 1993 John Wiley & Sons, Inc.
📜 SIMILAR VOLUMES
For all n $ S or 9 (mod 12) the genu3 :lf the granh II, x K, is shown t#c> be equal to the lower hound given by the Euler Formula. Consider two disjoint copies of a complete graph K,, the first t&h vertices 1,2, . . -, n, the second with vertices l', 2', . . .) n'. Then join vertex i with vertex i'
The formation and reduction with hydrogen of ordered oxygen layers on Rh( I 10) has been studied by means of LEED, Auger spectroscopy and thermal desorption. We show that it is possible to prepare clean, (1 X n) reconstructed Rh ( I 10) surfaces by suitable thermal and chemical treatment. Adsorption