Supereulerian generalized prisms

Computer Science and Service System(2011)

引用 0|浏览2
暂无评分
摘要
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.
更多
查看译文
关键词
petersen graph,supereulerian,symmetric group,supereulerian generalized prisms,graph theory,generalized prisms,vertices,terminology,tin
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要