Abstract
The undirected de Bruijn graph is often used as the model of communication network for its useful properties, such as short diameter, small maximum vertex degree. In this paper, we consider the alphabet overlap graph G(k, d, s): the vertex set V = {v|v = (v 1 …v k ); v i ∈ {1, 2,…, d}, i = 1, 2,…, k}; they are distinct and two vertices u = (u 1…u k ) and v = (v 1…v k ) are adjacent if and only if u s+i = v i or v s+i = u i (i = 1, 2,…, k − s). In particular, when s = 1, G(k, d, s) is just an undirected de Bruijn graph. First, we give a formula to calculate the vertex degree of G(k, d, s). Then, we use the corollary of Menger’s theorem to prove that the connectivity of G(k, d, s) is 2d s − 2d 2s−k for s ≥ k/2.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Diestel R. Graph Theory (2nd edition), Springer-Verlag, 2000.
Godbole A, Knisley D, Norwood R. Some properties of alphabet overlap graphs, http://arxiv.org/abs/math/0510094.
Patwardhan R, Tang H, Kim S, Dalkilie M. An approximate de Bruijn graph approach to multiple local alignment and mitif discovery on protein sequences. In Proc. the 1st International Conference on Data Mining and Bioinformatics, Sept. 2006, pp.158–169.
Lin H. 1-Fair alternator designs for the de Bruijn network [Master’s Thesis]. National Sun Yat-sen University, 2006.
Abed S, Mokhtari Y, Ait-Mohamed O, Tahar S. NuMDG: A new tool for multiway decision graphs construction. Journal of Computer Science and Technology, Jan. 2011, 26(1): 139–152.
Debra K, Yared N, Attila P. On the chromatic number of α-overlap graphs. Journal of Combinatorial Mathematics and Computational Computing, 2010, 73: 3–13.
Blasewicz J, Hertz A, Kobler D, de Werra D. On some properties of DNA graphs. Discrete Appl. Math., 1999, 98(1/2): 1–19.
Wang S, Yuan J. DNA computing of directed line-graphs. Communications Mathematical and in Computer Chemistry, 2006, 56(3): 479–484.
Li X Y, Zhang H P. Embedding on alphabet overlap digraphs. J. Math. Chem., 2010, 47(1): 62–71.
Rivals E, Rahmann S. Combinatorics of periods in strings. J. Combin. Theory, Series A, 2003, 104(1): 95–113.
Liu C H, Zhang K M. Super connectivity and restricted connectivity of undirected de Bruijn graph. Acta Mathematicae Applicatae Sinica., 2002, 25(1): 29–35.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Yang, R., Yang, ZL. & Zhang, HP. Some Indices of Alphabet Overlap Graph. J. Comput. Sci. Technol. 27, 897–902 (2012). https://doi.org/10.1007/s11390-012-1261-9
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11390-012-1261-9