DNA Graph Characterization for Line Digraph of Dicycle With One Chord
- Feb. 10, 2017
- 2:30 p.m.
- LeConte 312
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 (a,k)-labeling. Dicycle and depth 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 (a,k)-labeling to characterize line digraph of dicycle with one chord C^t_n as DNA graph and show that for natural numbers m, n, and t = n/2; L^m(C^t_n) are DNA graphs.