@article {
author = {Malekpour, Shahide and Bazigaran, Behnam},
title = {Automorphism group of a graph constructed from a lattice},
journal = {Journal of Discrete Mathematics and Its Applications},
volume = {9},
number = {3},
pages = {173-179},
year = {2024},
publisher = {Shahid Rajaee Teacher Training University},
issn = {2981-0809},
eissn = {2981-0809},
doi = {10.22061/jdma.2024.11157.1082},
abstract = {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.},
keywords = {Automorphism group of a graph,prime filter,automorphism group of a lattice,perfect maching of a graph},
url = {https://jdma.sru.ac.ir/article_2183.html},
eprint = {https://jdma.sru.ac.ir/article_2183_94459280bc24c4573d2e828fbd8ad4ca.pdf}
}