On a Vizing-like conjecture for direct product graphs
✍ Scribed by Sandi Klavẑar; Blaẑ Zmazek
- Publisher
- Elsevier Science
- Year
- 1996
- Tongue
- English
- Weight
- 163 KB
- Volume
- 156
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
✦ Synopsis
Let 7(G) be the domination number of a graph G, and let G ×H be the direct product of graphs G and H. It is shown that for any k t> 0 there exists a graph G such that 7(G × G) ~< 7(G) 2 -k. This in particular disproves a conjecture from .
📜 SIMILAR VOLUMES
Kotzig (see Bondy and Murty (1976)) conjectured that there exists no graph with the property that every pair of vertices is connected by a unique path of length k, k>2. Here we prove this conjecture for k> 12.
A simple, one-step procedure is described for measurement of the enzymatic transfer of radioactive methyl groups from S-adenosyl-r,-methionine to 0-demethylpuromycin. Reactions are carried out in small, stoppered scintillation vials and terminated by the addition of 0.1 M sodium borate-5 M NaCl (pH