The exact domination number of generalized Petersen graphs(P(n,k))with(n=2k)and(n=2k+2^{*})
β Scribed by Liu, Juan; Zhang, Xindong
- Book ID
- 121618768
- Publisher
- Springer-Verlag
- Year
- 2013
- Tongue
- English
- Weight
- 824 KB
- Volume
- 33
- Category
- Article
- ISSN
- 0101-8205
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
In this article, we will determine the crossing number of the complete tripartite graphs K,.3.n and K2,3.n. Our proof depends on Kleitman's results for the complete bipartite graphs [D. J. Kleitman, The crossing number of K5,n. J. Combhatorial Theory 9 (1970) 375-3231. a graph G is the minimum numbe
In this paper we prove that the set of positive odd integers k such that k&2 n has at least three distinct prime factors for all positive integers n contains an infinite arithmetic progression. The same result corresponding to k2 n +1 is also true.
## Abstract An upper bound on the Ramsey number __r__(__K__~2,__nβs__~,__K__~2,__n__~) where __s__ β₯ 2 is presented. Considering certain __r__(__K__~2,__nβs__~,__K__~2,__n__~)βcolorings obtained from strongly regular graphs, we additionally prove that this bound matches the exact value of __r__(__K