Nilpotent graphs with crosscap at most two
Let R be a commutative ring with identity. The nilpotent graph of R, denoted by Γ N ( R ) , is a graph with vertex set Z N ( R ) ∗ , and two vertices x and y are adjacent if and only if x y is nilpotent, where Z N ( R ) = { x ∈ R : x y is nilpotent, for some y ∈ R ∗ } . In this paper, we characteriz...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Taylor & Francis Group
2018-12-01
|
| Series: | AKCE International Journal of Graphs and Combinatorics |
| Online Access: | http://www.sciencedirect.com/science/article/pii/S0972860017301032 |