<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<ArticleSet>
<Article>
<Journal>
<PublisherName>International Academy of Ecology and Environmental Sciences</PublisherName>
<JournalTitle>Network Biology</JournalTitle>
<issn>2220-8879</issn>
<Volume>12</Volume>
<Issue>1</Issue>
<PubDate PubStatus="ppublish">
<Year>2022</Year>
<Month>3</Month>
<Day>1</Day>
</PubDate>
</Journal>
<ArticleTitle>A study of the total graph in genetic code algebra</ArticleTitle>
<Pages>1-10</Pages>
<Language>EN</Language>
<AuthorList>
<Author>Birinchi Kumar Boruah</Author>
<Author>Tazid Ali</Author>
</AuthorList>
<ArticleList>
<ArticleId IdType="url">http://www.iaees.org/publications/journals/nb/articles/2022-12(1)/total-graph-in-genetic-code-algebra.pdf</ArticleId>>
</ArticleList>
<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>
</Article>
</ArticleSet>
