Journal of Mathematical Chemistry

, Volume 42, Issue 1, pp 65–79 | Cite as

Characterizations for Some Types of DNA Graphs

  • Xianyue Li
  • Heping Zhang


Vertex induced subgraphs of directed de Bruijn graphs with labels of fixed length k and over α letter alphabet are (α,k)-labelled. DNA graphs are (4,k)-labelled graphs. Pendavingh et al. proved that it is NP-hard to determine the smallest value α k (D) for which a directed graph D can be (α k (D),k)-labelled for any fixed \(k \geqslant 3\). In this paper, we obtain the following formulas: \(\alpha_k(C_n)=\lceil\sqrt[k-1]{n}\rceil\) and\(\alpha_k(P_n)=\lceil\sqrt[k-1]{n+1}\rceil\) for cycle C n and path P n . Accordingly, we show that both cycles and paths are DNA graphs. Next we prove that rooted trees and self-adjoint digraphs admit a (Δ,k)-labelling for some positive integer k and they are DNA graphs if and only if Δ ≤ 4, where Δ is the maximum number in all out-degrees and in-degrees of such digraphs.


DNA graph de Bruijn graph (α, k)-labelling 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Bains W., and Smith G.C. (1988). A novel method for nucleic acid sequence determination. J. Theoret. Biol. 135:303–307CrossRefGoogle Scholar
  2. 2.
    Bang-Jensen J. and Gutin G. (2001). Digraphs: Theory, Algorithms and Applications. Springer-Verlag, LondonMATHGoogle Scholar
  3. 3.
    Błażewicz J., Formanowicz P., Kasprzak M., and Kobler D. (2002). On the recognition of de Bruijn graphs and their induced subgraphs. Discrete Math. 245:81–92CrossRefMathSciNetGoogle Scholar
  4. 4.
    Błażewicz J., Hertz A., Kobler D., and de Werra D. (1999). On some properties of DNA graphs. Discrete Appl. Math. 98:1–19CrossRefMathSciNetGoogle Scholar
  5. 5.
    de Bruijn N.G. (1946). A combinatorial problem, Nederl. Akad. Wetensch. 49:758–764 (Indagationes Math. 8 (1946) 461–467)Google Scholar
  6. 6.
    Hao J. (2005). The adjoints of DNA graphs. J. Math. Chem. 37:333–346CrossRefMathSciNetMATHGoogle Scholar
  7. 7.
    Imori M., Matsumoto M., and Yamada H. (1988). The line digraph of a regular and pancircular digraph is also regular and pancircular. Graphs Combin. 4:235–239CrossRefMATHMathSciNetGoogle Scholar
  8. 8.
    Pendavingh R., Schuurman P., and Woeginger G.J. (2003). Recognizing DNA graphs is difficult. Discrete Appl. Math. 127:85–94CrossRefMATHMathSciNetGoogle Scholar

Copyright information

© Springer Science+Business Media, Inc. 2006

Authors and Affiliations

  1. 1.School of Mathematics and StatisticsLanzhou UniversityLanzhouP.R. China

Personalised recommendations