Open AccessChromatic Number of Pseudo-Von neuman Regular Graph
Author(s) -
Nabeel E. Arif,
Nermen J. Khalel
Publication year - 2020
Publication title -
mağallaẗ ibn al-haytam li-l-ʻulūm al-ṣirfaẗ wa-al-taṭbīqiyyaẗ/ibn al-haitham journal for pure and applied sciences
Language(s) - English
Resource type - Journals
eISSN - 2521-3407
pISSN - 1609-4042
DOI - 10.30526/33.2.2436
Subject(s) - combinatorics , mathematics , windmill graph , graph , wheel graph , vertex (graph theory) , chromatic scale , friendship graph , commutative ring , regular graph , graph power , distance regular graph , petersen graph , discrete mathematics , line graph , commutative property
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).