DNA graph characterization for line digraph of dicycle with one chord

Research output: Contribution to journalArticlepeer-review

Abstract

Characterization of DNA graph gives important contribution in completing the computational step of Sequencing by Hybridization (SBH). Some graphs are already characterized as DNA graph using (α, k)-labeling. Dicycle and dipath are DNA graphs, while rooted trees and self adjoint digraphs are DNA graphs if and only if their maximum degree is not greater than four. In this paper we also use (α, k)-labeling to characterize line digraph of dicycle with one chord Cn t as DNA graph and show that for m, n ∈ ℕ, t = [n/2], Lm(Cn t) are DNA graphs.

Original languageEnglish
Pages (from-to)157-167
Number of pages11
JournalAKCE International Journal of Graphs and Combinatorics
Volume10
Issue number2
Publication statusPublished - 1 Aug 2013

Keywords

  • (α, K)-labeling
  • DNA graph

Fingerprint Dive into the research topics of 'DNA graph characterization for line digraph of dicycle with one chord'. Together they form a unique fingerprint.

Cite this