TY - JOUR
ID - 2183
TI - Automorphism group of a graph constructed from a lattice
JO - Journal of Discrete Mathematics and Its Applications
JA - JDMA
LA - en
SN -
AU - Malekpour, Shahide
AU - Bazigaran, Behnam
AD - Department of Mathematics
AD - Department of Mathematics, University of Kashan
Y1 - 2024
PY - 2024
VL - 9
IS - 3
SP - 173
EP - 179
KW - Automorphism group of a graph
KW - prime filter
KW - automorphism group of a lattice
KW - perfect maching of a graph
DO - 10.22061/jdma.2024.11157.1082
N2 - 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.
UR - https://jdma.sru.ac.ir/article_2183.html
L1 - https://jdma.sru.ac.ir/article_2183_94459280bc24c4573d2e828fbd8ad4ca.pdf
ER -