
We define the Product Cube Graph PC(R) over a finite commutative ring R as a graph on nonzero elements and adjacency occurs when their product is a cube in R. We investigate its structural properties, including connectivity, diameter, clique structure, and bipartiteness. For finite fields F, PC(F) is completely characterized.
zero-divisor graph, connectivity, cube elements, Product cube graph, finite fields., finite commutative ring
zero-divisor graph, connectivity, cube elements, Product cube graph, finite fields., finite commutative ring
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
