<?xml version="1.0" encoding="UTF-8"?>
<records>
<record>
<language>eng</language>
<publisher>International Academy of Ecology and Environmental Sciences</publisher>
<journalTitle>Network Biology</journalTitle>
<issn>2220-8879</issn>
<publicationDate>2022-3-1</publicationDate>
<volume>12</volume>
<issue>1</issue>
<startPage>1</startPage>
<endPage>10</endPage>
<doi> </doi>
<publisherRecordId>1</publisherRecordId>
<documentType>article</documentType>
<title language="eng">A study of the total graph in genetic code algebra</title>
<authors>
<author>
<name>Birinchi Kumar Boruah</name>
<email></email>
<affiliationId>1</affiliationId>
<affiliationId>2</affiliationId>
</author>
<author>
<name>Tazid Ali</name>
<email></email>
<affiliationId>1</affiliationId>
<affiliationId>2</affiliationId>
</author>
</authors>
<affiliationsList>
<affiliationName affiliationId="1">
Department of Mathematics, Dibrugarh University, Assam 786004, India
</affiliationName>
</affiliationsList>
<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>
<fullTextUrl format="pdf">
http://www.iaees.org/publications/journals/nb/articles/2022-12(1)/total-graph-in-genetic-code-algebra.pdf
</fullTextUrl>
<keywords>
<keyword>genetic code</keyword>
<keyword>amino acid</keyword>
<keyword>mutation</keyword>
<keyword>total graph</keyword>
</keywords>
</record>
</records>
