Semisymmetric Zp-covers of the C20 graph
-
Published:2021
Issue:2
Volume:31
Page:286-301
-
ISSN:1726-3255
-
Container-title:Algebra and Discrete Mathematics
-
language:
-
Short-container-title:ADM
Author:
Talebi A. A., ,Mehdipoor N.,
Abstract
A graph X is said to be G-semisymmetric if it is regular and there exists a subgroup G of A:=Aut(X) acting transitively on its edge set but not on its vertex set. In the case of G=A, we call X a semisymmetric graph. Finding elementary abelian covering projections can be grasped combinatorially via a linear representation of automorphisms acting on the first homology group of the graph. The method essentially reduces to finding invariant subspaces of matrix groups over prime fields. In this study, by applying concept linear algebra, we classify the connected semisymmetric zp-covers of the C20 graph.
Publisher
State University Luhansk Taras Shevchenko National University
Subject
Discrete Mathematics and Combinatorics,Algebra and Number Theory
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献