مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

video

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

sound

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Persian Version

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

View:

19
مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Download:

1
مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Cites:

Information Journal Paper

Title

Cubic semisymmetric graphs of order $44p$ or $44p^{2}$

Pages

  161-172

Abstract

 A simple graph is called semisymmetric if it is regular and edge-transitive but not vertex-transitive. Let $p$ be an arbitrary prime. Folkman [J. Folkman, Regular line-symmetric graphs, J. Combinatorial Theory, \textbf{3} (1967) 215--232.] proved that there are no cubic semisymmetric graphs of order $2p$ or $2p^{2}$. In this paper, an extension of his result in the case of cubic graphs of order $44p$ or $44p^{2}$ is given. By using group theoretic methods, we prove that there are no connected cubic semisymmetric graphs of order $44p$ or $44p^{2}$.

Multimedia

  • No record.

    • Cites

  • No record.

    • References

  • No record.

    • Cite

    Related Journal Papers

  • No record.

    • Related Seminar Papers

  • No record.

    • Related Plans

  • No record.

    • Recommended Workshops






    Move to top
    telegram sharing button
    whatsapp sharing button
    linkedin sharing button
    twitter sharing button
    email sharing button
    email sharing button
    email sharing button
    sharethis sharing button