Nilpotent Graph

DOI10.20429/TAG.2021.080102zbMATH Open1462.05169arXiv1804.08937OpenAlexW4210358179MaRDI QIDQ4987151FDOQ4987151

Aajay Sharma, Rahul Dutta, D. K. Basnet

Publication date: 28 April 2021

Published in: Theory and Applications of Graphs (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1804.08937

zbMATH Keywords

clique numbergirthLaplacian spectrumsignless Laplacian spectrumdominating numberchromatic indexfinite commutative ring

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Coloring of graphs and hypergraphs (05C15) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) General commutative ring theory (13A99)

Cited In (3)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Nilpotent 1-factorizations of the complete graph 👍 👎
• Nilpotent graphs with crosscap at most two 👍 👎
• Nilpotent graphs of genus one 👍 👎
• On the nilpotent graph of a ring 👍 👎
• Nullity of Graphs 👍 👎
• Perfect Nilpotent Graphs 👍 👎

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)