Journal of East China Normal University(Natural Sc ›› 2010, Vol. 2010 ›› Issue (6): 137-141.

• Article • Previous Articles     Next Articles

Weighted graphs permitting no LEW-embeddings

CAO Ni, LIU Ni, REN Han   

  1. Department of Mathematics, East China Normal University, Shanghai 200241, China
  • Received:2009-11-01 Revised:2010-02-01 Online:2010-11-25 Published:2010-11-25
  • Contact: REN Han

PDF

1310

Abstract: This article studied the LEW (large edge width) embeddability of weighted grid graph G(a,b)(a≥2,b≥2) and the Mobius ladder graph Gn(n≥4) and showed that such two types of weighted graphs have no LEW-embeddings. Based on these two kinds of graphs weighted graphs were constructed which are strongly embedded in Sn and Nh and permit no LEW-embeddings in the same surface they embedded.

Key words: Mobius ladder, LEW~embedding, orientable/non-orientable surface, grid graph, Mobius ladder, LEW~embedding, orientable/non-orientable surface

CLC Number: