Chromatic Number of Pseudo-Von neuman Regular Graph
Main Article Content
Abstract
Let R be a commutative ring , the pseudo – von neuman regular graph of the ring R is define as a graph whose vertex set consists of all elements of R and any two distinct vertices a and b are adjacent if and only if , this graph denoted by P-VG(R) , in this work we got some new results a bout chromatic number of P-VG(R).
Article Details
How to Cite
Chromatic Number of Pseudo-Von neuman Regular Graph. (2020). Ibn AL-Haitham Journal For Pure and Applied Sciences, 33(2), 149-155. https://doi.org/10.30526/33.2.2436
Issue
Section
Mathematics
licenseTerms
How to Cite
Chromatic Number of Pseudo-Von neuman Regular Graph. (2020). Ibn AL-Haitham Journal For Pure and Applied Sciences, 33(2), 149-155. https://doi.org/10.30526/33.2.2436