>
Fa   |   Ar   |   En
   automorphism group of a graph constructed from a lattice  
   
نویسنده malekpour shahide ,bazigaran behnam
منبع journal of discrete mathematics and its applications - 2024 - دوره : 9 - شماره : 3 - صفحه:173 -179
چکیده    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
کلیدواژه automorphism group of a graph ,prime filter ,automorphism group of a lattice ,perfect maching of a graph
آدرس university of kashan, faculty of mathematical sciences, department of mathematics, iran, university of kashan, faculty of mathematical sciences, department of mathematics, iran
پست الکترونیکی bazigaran@kashanu.ac.ir
 
     
   
Authors
  
 
 

Copyright 2023
Islamic World Science Citation Center
All Rights Reserved