Abstract
The divisor graph, denoted by D(Z p [x,n]), is the graph whose vertex set is the set of all polynomials of degree at most n whose coefficients are from field Z p 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(Z p [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 Z p [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 Z p [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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callSimilar Papers
More From: J. Math. Comput. Sci.
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
