Rainbow connectivity in some cayley graphs
Publication
, Journal Article
Bau, S; Johnson, P; Jones, E; Kumwenda, K; Matzke, R
Published in: Australasian Journal of Combinatorics
January 1, 2018
The rainbow and strong rainbow connection numbers, as well as variants of these in which the edge colorings are required to be proper, are estimated and in some cases determined exactly for some Cayley graphs, including the Hamming graphs H(n, q, k), excluding the cases (i) k = n and (ii) k < n, k even and q = 2.
Duke Scholars
Published In
Australasian Journal of Combinatorics
EISSN
2202-3518
ISSN
1034-4942
Publication Date
January 1, 2018
Volume
71
Issue
3
Start / End Page
381 / 393
Related Subject Headings
- 0802 Computation Theory and Mathematics
- 0103 Numerical and Computational Mathematics
- 0101 Pure Mathematics
Citation
APA
Chicago
ICMJE
MLA
NLM
Bau, S., Johnson, P., Jones, E., Kumwenda, K., & Matzke, R. (2018). Rainbow connectivity in some cayley graphs. Australasian Journal of Combinatorics, 71(3), 381–393.
Bau, S., P. Johnson, E. Jones, K. Kumwenda, and R. Matzke. “Rainbow connectivity in some cayley graphs.” Australasian Journal of Combinatorics 71, no. 3 (January 1, 2018): 381–93.
Bau S, Johnson P, Jones E, Kumwenda K, Matzke R. Rainbow connectivity in some cayley graphs. Australasian Journal of Combinatorics. 2018 Jan 1;71(3):381–93.
Bau, S., et al. “Rainbow connectivity in some cayley graphs.” Australasian Journal of Combinatorics, vol. 71, no. 3, Jan. 2018, pp. 381–93.
Bau S, Johnson P, Jones E, Kumwenda K, Matzke R. Rainbow connectivity in some cayley graphs. Australasian Journal of Combinatorics. 2018 Jan 1;71(3):381–393.
Published In
Australasian Journal of Combinatorics
EISSN
2202-3518
ISSN
1034-4942
Publication Date
January 1, 2018
Volume
71
Issue
3
Start / End Page
381 / 393
Related Subject Headings
- 0802 Computation Theory and Mathematics
- 0103 Numerical and Computational Mathematics
- 0101 Pure Mathematics