Co-identity join graph of lattices

Document Type : Research Articles

Author

Department of Mathematics, Guilan University, Rasht, Iran

10.22080/cjms.2024.24996.1645

Abstract

Let $\pounds$ be a lattice with $1$ and $0$. The co-identity join graph of $\pounds$, denoted by $\mathbb{CG} (\pounds)$, is an undirected simple graph whose vertices are all nontrivial elements (i.e. different from $1$ and $0$) of $\pounds$ and two distinct elements $x$ and $y$ are adjacent if and only if $x \vee y \neq 1$. The basic properties and possible structures of this graph are studied and the interplay between the algebraic properties of $\pounds$ and the graph-theoretic structure of $\mathbb{CG} (\pounds)$ is investigated.\\

Keywords

Main Subjects

Files

Share

How to cite

Statistics