Classifying Connected Pentavalent Symmetric Graphs of Order 40<i>pq</i>
A graph is said to be symmetric if the action of its automorphism group on the set of arcs is transitive (arc-transitive). Building upon prior work regarding the classification of symmetric graphs of valency five, this article investigates connected symmetric graphs of order <inline-formula><math xm...
Збережено в:
| Автори: | , |
|---|---|
| Формат: | Artigo |
| Мова: | Inglês |
| Опубліковано: |
MDPI AG
2026-03-01
|
| Серія: | Mathematics |
| Предмети: | |
| Онлайн доступ: | https://www.mdpi.com/2227-7390/14/5/852 |
| Теги: |
Немає тегів, Будьте першим, хто поставить тег для цього запису!
|