A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
Let R be a commutative ring with identity 1 ̸= 0. Define the comaximal graph of R, denoted by CG(R), to be the graph whose vertices are the elements of R, where two distinct vertices a and b are adjacent if and only if Ra + Rb = R. A vertex a in a simple graph G is said to be a Smarandache vertex (or S-vertex for short) provided that there exist three distinct vertices x, y, and b (all different from a) in G such that a—x, a—b, and b—y are edges in G but there is no edge between x and y. Thedoi:10.5281/zenodo.1419756 fatcat:oejthoghefey7ekkprhlaesb4m