Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
A graph associated with tri-potent elements of commutative ring R
View through CrossRef
In this paper, we introduce the tri-potent graph of a commutative ring R, denoted by TP(R), where two distinct vertices x and y in R are adjacent if and only if (x + y)3 = x + y. We conduct a comprehensive investigation of the graphical structural properties of tri-potent graph of a commutative ring R, including its diameter, connectedness, and size. It is shown that the tri-potent graph of a commutative ring R contains cycles with girth 3 and has no end vertices. Furthermore, we describe a significant spanning subgraph of the tri-potent graph of a commutative ring R and analyze the degree of each vertex in detail. Finally, we establish that, for a specific local ring, tri-potent graph of a commutative ring R forms a 3-partite graph, discuss its planarity, and determine its independence domination number.
Title: A graph associated with tri-potent elements of commutative ring R
Description:
In this paper, we introduce the tri-potent graph of a commutative ring R, denoted by TP(R), where two distinct vertices x and y in R are adjacent if and only if (x + y)3 = x + y.
We conduct a comprehensive investigation of the graphical structural properties of tri-potent graph of a commutative ring R, including its diameter, connectedness, and size.
It is shown that the tri-potent graph of a commutative ring R contains cycles with girth 3 and has no end vertices.
Furthermore, we describe a significant spanning subgraph of the tri-potent graph of a commutative ring R and analyze the degree of each vertex in detail.
Finally, we establish that, for a specific local ring, tri-potent graph of a commutative ring R forms a 3-partite graph, discuss its planarity, and determine its independence domination number.
Related Results
Bipartite through Prescribed Median and Antimedian of a Commutative Ring with Respect to an Ideal
Bipartite through Prescribed Median and Antimedian of a Commutative Ring with Respect to an Ideal
Introduction: There are plenty of ways of partners with arithmetical constructions. Some of them to make reference to are bipartite from gatherings, median and anti – median from c...
Graph convolutional neural networks for 3D data analysis
Graph convolutional neural networks for 3D data analysis
(English) Deep Learning allows the extraction of complex features directly from raw input data, eliminating the need for hand-crafted features from the classical Machine Learning p...
Graph data warehousing
Graph data warehousing
Over the last decade, we have witnessed the emergence of networks in a wide spectrum of application domains, ranging from social and information networks to biological and transpor...
Some Contributions to Boolean like near Rings
Some Contributions to Boolean like near Rings
In this paper we extend Foster’s Boolean-like ring to Near-rings. We introduce the concept of a Boolean like near-ring. A near-ring N is said to be a Boolean-like near-ring if the...
A graph with respect to idempotents of a ring-II
A graph with respect to idempotents of a ring-II
Let [Formula: see text] be a ring with unity. The idempotent graph [Formula: see text] of a ring [Formula: see text] is an undirected simple graph whose vertex set is [Formula: see...
The Retrograde Ring Of Dwarf Planet Quaoar
The Retrograde Ring Of Dwarf Planet Quaoar
The stability scenario about rings around celestial minor bodies and exoplanets has changed significantly in the past decade. There is still no consensus on how these ring systems ...
Bilangan Terhubung Titik Pelangi pada Graf Garis dan Graf Tengah dari Hasil Operasi Comb Graf Bintang C<sub>3</sub> dan Graf Bintang S<sub>n</sub>
Bilangan Terhubung Titik Pelangi pada Graf Garis dan Graf Tengah dari Hasil Operasi Comb Graf Bintang C<sub>3</sub> dan Graf Bintang S<sub>n</sub>
Penelitian ini bertujuan menentukan bilangan terhubung titik pelangi (rainbow vertex connection number) pada graf garis dan graf tengah yang diperoleh dari hasil operasi comb antar...
On the Commutative Operation of Approximate CMOS Ripple Carry Adders (RCAs)
On the Commutative Operation of Approximate CMOS Ripple Carry Adders (RCAs)
<p>Approximate cells can be used to design Ripple Carry Adders (RCAs) for realizing approximate addition in energy-efficient CMOS digital circuits. As inputs of approximate c...