On the double competition number
✍ Scribed by Zoltán Füredi
- Publisher
- Elsevier Science
- Year
- 1998
- Tongue
- English
- Weight
- 308 KB
- Volume
- 82
- Category
- Article
- ISSN
- 0166-218X
No coin nor oath required. For personal study only.
✦ Synopsis
It is known, that for U/~IIOS~ all /z-vertex simple graphs one needs S!(,j' '(log") ' ' ) extra vertices to obtain them as a double competition graph of a digraph. In this note a construction 15
given to shou that 2,~" ' are always sufficient.
📜 SIMILAR VOLUMES
It is known to be a hard problem to compute the competition number k(G) of a graph G in general. Park and Sano (in press) [16] gave the exact values of the competition numbers of Hamming graphs H(n, q) if 1 ≤ n ≤ 3 or 1 ≤ q ≤ 2. In this paper, we give an explicit formula for the competition numbers
We analyze the existence, stability, and multiplicity of T-periodic coexistence states for the classical nonautonomous periodic Lotka᎐Volterra competing species model. This is done by treating the average values of the birth rates of species as parameters, and studying the global structure of the se
The influence of intracavity second harmonic generation on the mode competition in a double-mode diode-pumped Nd:YAG laser is studied theoretically and experimentally. Various configurations of the optical cavity with II-type phase-matching frequency-doubling crystals are considered. The conditions