Number of the records: 1  

A refined classification of symmetric cubic graphs

  1. TitleA refined classification of symmetric cubic graphs
    Author infoMarston Conder, Roman Nedela
    Author Conder Marston (50%)
    Co-authors Nedela Roman 1960- (50%) UMBFP10 - Katedra matematiky
    Source document Journal of Algebra. Vol. 322, no. 3 (2009), pp. 722-740. - San Diego : Academic Press, 2009
    Keywords arc-transitive graph   s-regular graph   symmetric graphs  
    LanguageEnglish
    CountryUnited States of America
    systematics 519.1
    AnnotationRes. angl.
    Public work category ADC
    No. of Archival Copy13191
    Repercussion category LI, Yan-Tao - CHENG, Hui-Wen - MA, Qing-Hua. Cubic edge-transitive graphs of order 12p or 12p(2). In Ars combinatoria. ISSN 0381-7032, 2014, vol. 113, pp. 325-335.
    MORGAN, G. L. On symmetric and locally finite actions of groups on the quintic tree. In Discrete mathematics. ISSN 0012-365X, 2013, vol. 313, no. 21, pp. 2486-2492.
    ALAEIYAN, Mehdi - LASHANI, Mohsen - HOSSEINIPOOR, M. K. Semisymmetric cubic graphs of orders 36p, 36p(2). In Filomat. ISSN 0354-5180, 2013, vol. 27, no. 8, pp. 1569-1573.
    GLOVER, Henry H. - KUTNAR, Klavdija - MALNIC, Aleksander - MARUSIC, Dragan. Hamilton cycles in (2, odd, 3)-Cayley graphs. In Proceedings of the London Mathematical Society. ISSN 0024-6115, 2012, vol. 104, pp. 1171-1197.
    ALAEIYAN, Mehdi - LASHANI, Mohsen. Classification of cubic edge-transitive graphs of order 14p(2). In Hacettepe journal of mathematics and statistics. ISSN 1303-5010, 2012, vol. 41, no. 2, pp. 277-282.
    ALAEIYAN, M. - LASHANI, M. - OZEL, C. - KILICMAN, A. Cubic edge-transitive graphs of order 10p(2). In ICMS: International conference on mathematical science. Melville : American Institut of Mathematics, 2010. ISBN 978-0-7354-0863-0, pp. 629-634.
    Catal.org.BB301 - Univerzitná knižnica Univerzity Mateja Bela v Banskej Bystrici
    Databasexpca - PUBLIKAČNÁ ČINNOSŤ
    ReferencesPERIODIKÁ-Súborný záznam periodika
Number of the records: 1  

  This site uses cookies to make them easier to browse. Learn more about how we use cookies.