✨
Yapay Zeka Hızlı Bakış & Çıkarımlar
AI Insight⚡ TL;DR(1 Cümlede Hızlı Çıkarım)
We prove that every connected cubic edge-transitive graph of order 10p3 is vertex-transitive, where p is a prime.
📌 3 Maddede Bu Makale
🎯
Amaç & Hipotez:Connected cubic graphs of order $10p^ 3$ which admit an automorphism group acting semisymmetrically are investigated.
📊
Temel Bulgular & Veri:Connected cubic graphs of order $10p^ 3$ which admit an automorphism group acting semisymmetrically are investigated.
💡
Sonuç & Katkı:We prove that every connected cubic edge-transitive graph of order 10p3 is vertex-transitive, where p is a prime.
🔬Tür:Araştırma Makalesi
📍Kapsam:Genişletilmiş Akademik Örneklem
⚙️Değişkenler:Alan Parametreleri
Abstract
Connected cubic graphs of order $10p^ 3$ which admit an automorphism group acting semisymmetrically are investigated. We prove that every connected cubic edge-transitive graph of order 10p3 is vertex-transitive, where p is a prime.
🔖
Bu Makaleye Atıf Yap
ALAEIYAN, M., ONAGH, B. N. (2022). On semisymmetric cubic graphs of order $10p^3$. Hacettepe Journal of Mathematics and Statistics, Cilt: 40 - Sayı: 4, 531–535. https://ajindex.com/articles/530582