Hiindex LOGO

Research Article

DNA Algorithm for Pancyclicityand Vertex Connectivity of Graph


Author(s): Antony Xavier , Andrew Arokiaraj
Affiliation: Department of Mathematics,Loyola college,Chennai
Year of Publication: 2014
Source: International Journal of Computing Algorithm
     
×

Scholarly Article Identity Link


HTML:

<a href="http://www.hindex.org/2014/article.php?page=586"><img src="http://www.hindex.org/sai.php/2014SCIA316F0586" alt="SAI"></a>


File:

http://www.hindex.org/2014/p586.pdf


Citation: Antony Xavier, Andrew Arokiaraj. "DNA Algorithm for Pancyclicityand Vertex Connectivity of Graph." International Journal of Computing Algorithm 3.1 (2014): 58-60.

Abstract:
Finding the Pancyclicity and Vertex connectivity for a general graph is the problem in NP complete class. In this paper, a bio-computation way of solving these two problems has been proposed. DNA computation is more powerful because of its massive parallelism and high density storage capacity. Thereby, producing the VERTEXCONNECTIVITY, PANCYCLIC and GIRTH algorithm solvable in polynomial time. The method in tracing the k-cycle and k-cut vertex was also used for the computation.


Keywords DNA algorithm, pancyclic, Vertex connectivity, Girth.


  • BibTex
  • Reference
  • XML
  • JSON
  • Dublin Core
  • CSL

@article{DNA1458656, author = {Antony Xavier,Andrew Arokiaraj}, title = {DNA Algorithm for Pancyclicityand Vertex Connectivity of Graph}, journal={International Journal of Computing Algorithm}, volume={3}, issue={1}, issn = {2278-2397}, year = {2014}, publisher = {Scholarly Citation Index Analytics-SCIA}

  • [1] Ahmed Al-Kandari, Paul Manuel, IndraRajasingh. Wiener Index of Certain Interconnection Networks.International Conference of Mathematical and Computer Science ICMCS 2011.
  • [2] BojanMohar and Tom Pisanski.How to Compute the Wiener Index of a Graph. Journal of Mathematical Chemistry 2(1988)267-277.
  • [3] J in Xu, Xiao Ii Qiang, Kai Zhang, Cheng Zhang, J ing Yang, Rongkui Zhang. A parallel type of DNA computing model for graph vertex coloring problem.IEEE 2010.
  • [4] Leonard Adleman. Computing with DNA. Scientific American, 279(2):54– 61, August 1998
  • [5] Martyn Amos. Theoretical and Experimental DNA Computation.Springer. 2005.
  • [6] Mehdizadeh, Nekoui, Sabahil, Akbarimajd. A Modified DNAComputing Algorithm To Solve TSP. IEEE 2006.
  • [7] Mehdi Eatemadi, Ali Etemadi, & Mohammad-Mehdi Ebadzadeh. Finding the isomorphic graph with the use of algorithm based on DNA. International Journal of Advanced Computer Science, Vol. 1, No. 3, Pp. 106-109, Sep. 2011.
  • [8] Richard J. Lipton. DNA Solution of Hard Computational Problems. Science, New Series, Vol. 268. : 542-545, April 1995
  • [9] Yang Jing, Zhang Cheng, Xu Jin, Liu XiangRong&QiangXiaoLi. A novel computing model of the maximum clique problem based on circular DNA. Science China Press and Springer-Verlag Berlin Heidelberg 2010
  • [10] Xuncai Zhang, Ying Niu, Fei Li, ZuoxinGan. Solving minimum vertex cover problems with microfluidic DNA computer.IEEE 2012.
  • [11] ZoyaIgnatova, Israel Martinez, and Karl-Heinz Zimmermann.

  • <?xml version='1.0' encoding='UTF-8'?> <record> <language>eng</language> <journalTitle>International Journal of Computing Algorithm</journalTitle> <eissn>2278-2397 </eissn> <publicationDate>2014</publicationDate> <volume>3</volume> <issue>1</issue> <startPage>58</startPage> <endPage>60</endPage> <documentType>article</documentType> <title language='eng'>DNA Algorithm for Pancyclicityand Vertex Connectivity of Graph</title> <authors> <author> <name>Antony Xavier</name> </author> </authors> <abstract language='eng'>Finding the Pancyclicity and Vertex connectivity for a general graph is the problem in NP complete class. In this paper, a bio-computation way of solving these two problems has been proposed. DNA computation is more powerful because of its massive parallelism and high density storage capacity. Thereby, producing the VERTEXCONNECTIVITY, PANCYCLIC and GIRTH algorithm solvable in polynomial time. The method in tracing the k-cycle and k-cut vertex was also used for the computation.</abstract> <fullTextUrl format='pdf'>http://www.hindex.org/2014/p586.pdf</fullTextUrl> <keywords language='eng'> <keyword>DNA algorithm, pancyclic, Vertex connectivity, Girth.</keyword> </keywords> </record>

    { "@context":"http://schema.org", "@type":"publication-article","identifier":"http://www.hindex.org/2014/article.php?page=586", "name":"DNA Algorithm for Pancyclicityand Vertex Connectivity of Graph", "author":[{"name":"Antony Xavier "}], "datePublished":"2014", "description":"Finding the Pancyclicity and Vertex connectivity for a general graph is the problem in NP complete class. In this paper, a bio-computation way of solving these two problems has been proposed. DNA computation is more powerful because of its massive parallelism and high density storage capacity. Thereby, producing the VERTEXCONNECTIVITY, PANCYCLIC and GIRTH algorithm solvable in polynomial time. The method in tracing the k-cycle and k-cut vertex was also used for the computation.", "keywords":["DNA algorithm, pancyclic, Vertex connectivity, Girth."], "schemaVersion":"https://schema.org/version/3.3", "includedInDataCatalog":{ "@type":"DataCatalog", "name":"Scholarly Citation Index Analytics-SCIA", "url":"http://hindex.org"}, "publisher":{"@type":"Organization", "name":"Scientific Communications Research Academy" } }

    <?xml version='1.0' encoding='utf-8'?> <oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd"> <dc:contributor>Andrew Arokiaraj</dc:contributor> <dc:contributor></dc:contributor> <dc:contributor></dc:contributor> <dc:creator>Antony Xavier</dc:creator> <dc:date>2014</dc:date> <dc:description>Finding the Pancyclicity and Vertex connectivity for a general graph is the problem in NP complete class. In this paper, a bio-computation way of solving these two problems has been proposed. DNA computation is more powerful because of its massive parallelism and high density storage capacity. Thereby, producing the VERTEXCONNECTIVITY, PANCYCLIC and GIRTH algorithm solvable in polynomial time. The method in tracing the k-cycle and k-cut vertex was also used for the computation.</dc:description> <dc:identifier>2014SCIA316F0586</dc:identifier> <dc:language>eng</dc:language> <dc:title>DNA Algorithm for Pancyclicityand Vertex Connectivity of Graph</dc:title> <dc:type>publication-article</dc:type> </oai_dc:dc>

    { "identifier": "2014SCIA316F0586", "abstract": "Finding the Pancyclicity and Vertex connectivity for a general graph is the problem in NP complete class. In this paper, a bio-computation way of solving these two problems has been proposed. DNA computation is more powerful because of its massive parallelism and high density storage capacity. Thereby, producing the VERTEXCONNECTIVITY, PANCYCLIC and GIRTH algorithm solvable in polynomial time. The method in tracing the k-cycle and k-cut vertex was also used for the computation.", "author": [ { "family": "Antony Xavier,Andrew Arokiaraj" } ], "id": "586", "issued": { "date-parts": [ [ 2014 ] ] }, "language": "eng", "publisher": "Scholarly Citation Index Analytics-SCIA", "title": " DNA Algorithm for Pancyclicityand Vertex Connectivity of Graph", "type": "publication-article", "version": "3" }