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 : R1) of a finite graph G over the real line R1 is equal to the cutwidth of G. We give a lower bound of m(G : R1) and determine m(G : R1) for an n-constructed graph G.
|Number of pages||10|
|Journal||Tokyo Journal of Mathematics|
|Publication status||Published - 2014 Jun 1|
- Finite graph
ASJC Scopus subject areas