摘要

For topological spaces X and Y, the multiplicity m(X : Y) of X over Y is defined by M. Gromov and K. Taniyama independently. We show that the multiplicity m(G : R-1) of a finite graph G over the real line R-1 is equal to the cutwidth of G. We give a lower bound of m (G : R-1) and determine m(G : R-1) for an n-constructed graph G.

  • 出版日期2014-6

全文