<?xml version="1.0" encoding="UTF-8" ?>
<xml>
<records>
<record>
<title>A study of the total graph in genetic code algebra</title>
<authors>
<author>Birinchi Kumar Boruah</author>
<author>Tazid Ali</author>
</authors>
<affiliations>
<affiliation>
Department of Mathematics, Dibrugarh University, Assam 786004, India
</affiliation>
</affiliations>
<journal>Network Biology</journal>
<issn>ISSN 2220-8879</issn>
<homepage>http://www.iaees.org/publications/journals/nb/online-version.asp</homepage>
<year>2022</year>
<volume>12</volume>
<issue>1</issue>
<startpage>1</startpage>
<endpage>10</endpage>
<publisher>International Academy of Ecology and Environmental Sciences</publisher>
<location>Hong Kong</location>
<date>
<received>20 September 2021</received>
<accepted>30 October 2021</accepted>
<published>1 March 2022</published>
</date>
<keywords>
<keyword>genetic code</keyword>
<keyword>amino acid</keyword>
<keyword>mutation</keyword>
<keyword>total graph</keyword>
</keywords>
<abstract>
Suppose R be a commutative ring and Z(R) its set of zero-divisors. Total graph is the (undirected) graph where set of all elements of R is taken as the vertex set and two vertices say x and y (x not equals to y) in R are adjacent if and only if their sum is zero-divisor. Genetic code is the blueprint for protein synthesis. In this paper we discuss total graph in the genetic code algebra.
</abstract>
<url>http://www.iaees.org/publications/journals/nb/articles/2022-12(1)/total-graph-in-genetic-code-algebra.pdf</url>
</record>
</records>
</xml>
