Elementary abelian covers of the Wreath graph W (3, 2) and the Foster graph F26A

Elementary abelian covers of the Wreath graph W (3, 2) and the Foster graph F26A

AbstractArc-transitive and edge-transitive graphs are widely used in computer networks. Therefore, it is very useful to introduce and study the properties of these graphs. A graph [Formula: see text] can be called [Formula: see text]-edge-transitive (G-E-T) or [Formula: see text]-arc-transitive (G-A...

Full description

Bibliographic Details
Main Authors: Z. Chen, S. Kosari, S. Omidi, N. Mehdipoor, A. A. Talebi, H. Rashmanlou
Format: Article
Language:English
Published: Taylor & Francis Group 2023-01-01
Series:AKCE International Journal of Graphs and Combinatorics
Subjects:
Invariant subspace
A-T graphs
Wreath graph W
Foster graph F26A
(A-T) C-P
(E-T) C-P
Online Access:https://www.tandfonline.com/doi/10.1080/09728600.2022.2156310

Internet

https://www.tandfonline.com/doi/10.1080/09728600.2022.2156310

Similar Items