Number of irreducible factors and degree in divisor graph of Zp[x,n]
Abstract
The divisor graph, denoted by D(Zp[x,n]), is the graph whose vertex set is the set of all polynomials of degree at most n whose coefficients are from field Zp and its any two distinct vertices are adjacent if one is a divisor of the other. In this paper, (i) we determine the degree of each vertex of D(Zp[x,3]) and also discuss its girth, size, degree sequence, irregularity index etc. (ii) We also establish that two polynomials of same degree k in Zp[x,n] having different number of irreducible factors, the one with fewer number of irreducible factors has smaller degree. (iii) Further, if two polynomials of same degree k in Zp[x,n] having same number of irreducible factors but different number of distinct irreducible factors, the one with fewer number of distinct irreducible factors has smaller degree.
Copyright © 2021 Pradeep Maan, Amit Sehgal, Archana Malik. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Cite this article
P. Maan, A. Sehgal, A. Malik, Number of irreducible factors and degree in divisor graph of Zp[x,n], J. Math. Comput. Sci. 11 (2021), 1364–1380. https://doi.org/10.28919/jmcs/5159
BibTeX
@article{Maan2021,
author = {Maan, Pradeep and Sehgal, Amit and Malik, Archana},
title = {Number of irreducible factors and degree in divisor graph of Zp[x,n]},
journal = {J. Math. Comput. Sci.},
volume = {11},
year = {2021},
pages = {1364--1380},
doi = {10.28919/jmcs/5159}
}