%0 Journal Article
%T Automorphism group of a graph constructed from a lattice
%J Journal of Discrete Mathematics and Its Applications
%I Shahid Rajaee Teacher Training University
%Z 2981-0809
%A Malekpour, Shahide
%A Bazigaran, Behnam
%D 2024
%\ 09/01/2024
%V 9
%N 3
%P 173-179
%! Automorphism group of a graph constructed from a lattice
%K Automorphism group of a graph
%K prime filter
%K automorphism group of a lattice
%K perfect maching of a graph
%R 10.22061/jdma.2024.11157.1082
%X 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.
%U https://jdma.sru.ac.ir/article_2183_94459280bc24c4573d2e828fbd8ad4ca.pdf