Symmetric graphs of valency 4 having a quasi-semiregular automorphism

Fu-Gang Yin and Yan-Quan Feng

Applied Mathematics and Computation, 2021, vol. 399, issue C

Abstract: Feng et al. (2019) characterized connected G-symmetric graphs of valency 4 having a quasi-semiregular automorphism, namely, a graph automorphism fixing a unique vertex in the vertex set of the graph and keeping the lengths of all other orbits equal, when G is soluble or the vertex stabilizer in G is not a 2-group. In this paper we prove that a connected symmetric graph with valency 4 having a quasi-semiregular automorphism is a Cayley graph on a group G with respect to S, where G is abelian of odd order and S is an orbit of a group of automorphisms of the group G.

Keywords: Simple group; Symmetric graph; Quasi-semiregular automorphism (search for similar items in EconPapers)
Date: 2021
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S009630032100062X
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:399:y:2021:i:c:s009630032100062x

DOI: 10.1016/j.amc.2021.126014

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().