Home The annihilating-ideal graph of a lattice
Article
Licensed
Unlicensed Requires Authentication

The annihilating-ideal graph of a lattice

  • Mojgan Afkhami EMAIL logo , Solmaz Bahrami , Kazem Khashyarmanesh and Faeze Shahsavar
Published/Copyright: July 31, 2015
Become an author with De Gruyter Brill

Abstract

Let L = (L,∧,∨) be a lattice with a least element called zero and denoted by 0. The annihilating-ideal graph of L, denoted by 𝔸𝔾(L), is a graph whose vertex-set is the set of all non-trivial ideals of L and, for every two distinct vertices I and J, I is adjacent to J if and only if IJ = {0}. In this paper, we study some properties of 𝔸𝔾(L). Also, we completely determine when the annihilating-ideal graph is complete bipartite, split and end-regular.

MSC: 05C10; 06B99

The authors would like to thank the referee for the careful reading of the manuscript and the helpful comments.

Received: 2013-12-18
Revised: 2014-7-6
Accepted: 2014-7-8
Published Online: 2015-7-31
Published in Print: 2016-3-1

© 2016 by De Gruyter

Downloaded on 6.9.2025 from https://www.degruyterbrill.com/document/doi/10.1515/gmj-2015-0031/pdf
Scroll to top button