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...

Whakaahuatanga katoa

I tiakina i:

Ngā taipitopito rārangi puna kōrero
Ngā kaituhi matua:	Z. Chen, S. Kosari, S. Omidi, N. Mehdipoor, A. A. Talebi, H. Rashmanlou
Hōputu:	Artigo
Reo:	Inglês
I whakaputaina:	Taylor & Francis Group 2023-01-01
Rangatū:	AKCE International Journal of Graphs and Combinatorics
Ngā marau:	Invariant subspace A-T graphs Wreath graph W Foster graph F26A (A-T) C-P (E-T) C-P
Urunga tuihono:	https://www.tandfonline.com/doi/10.1080/09728600.2022.2156310
Ngā Tūtohu:	Tāpirihia he Tūtohu Kāore He Tūtohu, Me noho koe te mea tuatahi ki te tūtohu i tēnei pūkete!

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

Ngā tūemi rite