✨
AI Summary & Key Takeaways
AI Insight⚡ TL;DR(Too Long; Didn't Read)
We prove that every connected cubic edge-transitive graph of order 10p3 is vertex-transitive, where p is a prime.
📌 3 Key Takeaways
🎯
Objective & Hypothesis:Connected cubic graphs of order $10p^ 3$ which admit an automorphism group acting semisymmetrically are investigated.
📊
Key Findings & Data:Connected cubic graphs of order $10p^ 3$ which admit an automorphism group acting semisymmetrically are investigated.
💡
Conclusion & Impact:We prove that every connected cubic edge-transitive graph of order 10p3 is vertex-transitive, where p is a prime.
🔬Design:Research Article
📍Scope:Comprehensive Sample
⚙️Variables:Domain Parameters
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.
🔖
Cite This Article
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