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.
Malekpour, S., & Bazigaran, B. (2024). Automorphism group of a graph constructed from a lattice. Journal of Discrete Mathematics and Its Applications, 9(3), 173-179. doi: 10.22061/jdma.2024.11157.1082
MLA
Shahide Malekpour; Behnam Bazigaran. "Automorphism group of a graph constructed from a lattice". Journal of Discrete Mathematics and Its Applications, 9, 3, 2024, 173-179. doi: 10.22061/jdma.2024.11157.1082
HARVARD
Malekpour, S., Bazigaran, B. (2024). 'Automorphism group of a graph constructed from a lattice', Journal of Discrete Mathematics and Its Applications, 9(3), pp. 173-179. doi: 10.22061/jdma.2024.11157.1082
VANCOUVER
Malekpour, S., Bazigaran, B. Automorphism group of a graph constructed from a lattice. Journal of Discrete Mathematics and Its Applications, 2024; 9(3): 173-179. doi: 10.22061/jdma.2024.11157.1082
)
)