A study on Nilpotent graph in genetic code algebra
2025
Birinchi Kumar Boruah
The genetic code is a set of codons that contains genetic information regarding the creation of protein molecules. We studied nilpotent graphs in genetic code algebra in this work. The vertex set is the set of all non-nilpotent elements of a ring, and two vertices are neighbouring if and only if their sum is nilpotent. Different measurements of centrality have been thoroughly examined in our current paper. We also investigated three network parameters: clustering coefficient, degree of dispersion, and skewness.
显示更多 [+] 显示较少 [-]AGROVOC关键词
书目信息
出版者
International Academy of Ecology and Environmental Sciences
其它主题
Centrality measure; Degree of distribution; Amino acid; Clustering coefficient; Correlation coefficient; Nilpotent graph
语言
英语
2025-11-19
DOAJ