Nilpotent Graph
From MaRDI portal
Publication:4987151
Abstract: In this article, we introduce the concept of nilpotent graph of a finite commutative ring. The set of all non nilpotent elements of a ring is taken as the vertex set and two vertices are adjacent if and only if their sum is nilpotent. We discuss some graph theoretic properties of nilpotent graph.
Recommendations
- Perfect nilpotent graphs
- Nilpotent graphs of matrix algebras
- scientific article; zbMATH DE number 528756
- Nilpotent graphs of genus one
- On the nilpotent graph of a ring
- Nullity of graphs
- Nullity of graphs
- Nilpotent 1-factorizations of the complete graph
- Nilpotent graphs with crosscap at most two
- scientific article; zbMATH DE number 1292455
Cited in
(12)- Perfect nilpotent graphs
- scientific article; zbMATH DE number 528756 (Why is no real title available?)
- Domination in the entire nilpotent element graph of a module over a commutative ring
- Nilpotent graphs of matrix algebras
- On the nilpotent graph of a ring
- Nilpotent graphs of skew polynomial rings over non-commutative rings
- The book thickness of nilpotent graphs
- Some results of weakly nilpotent graphs of rings
- Nilpotent graphs with crosscap at most two
- A typical graph structure of a ring
- Non-nilpotent graph of commutative rings
- scientific article; zbMATH DE number 7619490 (Why is no real title available?)
This page was built for publication: Nilpotent Graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4987151)