• DocumentCode
    2620321
  • Title

    Supereulerian generalized prisms

  • Author

    Li, Shengyu ; Li, Xiaomin

  • Author_Institution
    Sch. of Comput. Sci. & Inf. Eng., Chongqing Technol. & Bus. Univ., Chongqing, China
  • fYear
    2011
  • fDate
    27-29 June 2011
  • Firstpage
    2647
  • Lastpage
    2649
  • Abstract
    For a graph G with vertices labeled 1, 2, ⋯, n and a permutation α in Sn, the symmetric group on {1, 2, ⋯, n}, the α-generalized prism over G, α(G), consists of two copies of G, say Gx and Gy, along with the edges (xi, yα(i)), for 1 ≤ i ≤ n. In this note, we consider results of the form that if G has property P, then for any α ∈ S|V(G)|, α(G) is supereulerian. We proved that if a graph G is 2-edge-connected and has at most 5 vertices of degree 2, then for any α ∈ S|V(G)|, α(G) is supereulerian if and only if it is not the Petersen graph.
  • Keywords
    graph theory; Petersen graph; supereulerian generalized prisms; symmetric group; vertices; Contracts; Electronic mail; Graph theory; Terminology; Tin; Generalized prisms; Petersen graph; Supereulerian;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computer Science and Service System (CSSS), 2011 International Conference on
  • Conference_Location
    Nanjing
  • Print_ISBN
    978-1-4244-9762-1
  • Type

    conf

  • DOI
    10.1109/CSSS.2011.5974673
  • Filename
    5974673