Automorphism group of a graph constructed from a lattice

نویسندگان

1 Department of Pure Mathematics, Faculty of Mathematical Sciences, University of Kashan, Kashan 87317-53153, I. R. Iran

2 Department of Pure Mathematics, Faculty of Mathematical Sciences, University of Kashan, Kashan 87317-53153, I. R. Iran

doi
10.22061/jdma.2024.11157.1082
چکیده

Let $L$ be a lattice and $S$ be a $\wedge$-closed subset of $L$. The graph $\Gamma_{S}(L)$ is a simple graph with all elements of $L$ as vertex set and two distinct vertex $x,y$ are adjacent if and only if $x\vee y\in S$. In this paper, we verify the automorphism group of $\Gamma_{S}(L)$ and the relation by automorphism group of the lattice $L$. Also we study some properties of the graph $\Gamma_{S}(L)$ where $S$ is a prime filter or an ideal such as the perfect maching.