Multiplicity of finite graphs over the real Line

Shosaku Matsuzaki*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review


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.

Original languageEnglish
Pages (from-to)247-256
Number of pages10
JournalTokyo Journal of Mathematics
Issue number1
Publication statusPublished - 2014 Jun 1


  • Cutwidth
  • Edge-connectivity
  • Finite graph
  • Multiplicity

ASJC Scopus subject areas

  • Mathematics(all)


Dive into the research topics of 'Multiplicity of finite graphs over the real Line'. Together they form a unique fingerprint.

Cite this