Title of article
Automorphism group of a graph constructed from a lattice
Author/Authors
Malekpour ، Shahide Department of Mathematics - Faculty of Mathematical Sciences - University of Kashan , Bazigaran ، Behnam Department of Mathematics - Faculty of Mathematical Sciences - University of Kashan
From page
173
To page
179
Abstract
Let L be a lattice and S be a ∧-closed subset of L. The graph Γ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 ∨ y ∈ S. In this paper, we verify the automorphism group of ΓS(L) and the relation by automorphism group of the lattice L. Also we study some properties of the graph Γ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
Journal title
Journal of Discrete Mathematics and Its Applications
Journal title
Journal of Discrete Mathematics and Its Applications
Record number
2776211
Link To Document