Multiplicity of finite graphs over the real Line

Shosaku Matsuzaki

Research output: Contribution to journalArticle

Abstract

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
Volume37
Issue number1
Publication statusPublished - 2014 Jun 1

Fingerprint

Finite Graph
Real Line
Multiplicity
Topological space
Lower bound
Graph in graph theory

Keywords

  • Cutwidth
  • Edge-connectivity
  • Finite graph
  • Multiplicity

ASJC Scopus subject areas

  • Mathematics(all)

Cite this

Multiplicity of finite graphs over the real Line. / Matsuzaki, Shosaku.

In: Tokyo Journal of Mathematics, Vol. 37, No. 1, 01.06.2014, p. 247-256.

Research output: Contribution to journalArticle

Matsuzaki, S 2014, 'Multiplicity of finite graphs over the real Line', Tokyo Journal of Mathematics, vol. 37, no. 1, pp. 247-256.
Matsuzaki, Shosaku. / Multiplicity of finite graphs over the real Line. In: Tokyo Journal of Mathematics. 2014 ; Vol. 37, No. 1. pp. 247-256.
@article{77f9fbf634dc4b2c8c994014b298c602,
title = "Multiplicity of finite graphs over the real Line",
abstract = "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.",
keywords = "Cutwidth, Edge-connectivity, Finite graph, Multiplicity",
author = "Shosaku Matsuzaki",
year = "2014",
month = "6",
day = "1",
language = "English",
volume = "37",
pages = "247--256",
journal = "Tokyo Journal of Mathematics",
issn = "0387-3870",
publisher = "Publication Committee for the Tokyo Journal of Mathematics",
number = "1",

}

TY - JOUR

T1 - Multiplicity of finite graphs over the real Line

AU - Matsuzaki, Shosaku

PY - 2014/6/1

Y1 - 2014/6/1

N2 - 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.

AB - 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.

KW - Cutwidth

KW - Edge-connectivity

KW - Finite graph

KW - Multiplicity

UR - http://www.scopus.com/inward/record.url?scp=84908080553&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84908080553&partnerID=8YFLogxK

M3 - Article

VL - 37

SP - 247

EP - 256

JO - Tokyo Journal of Mathematics

JF - Tokyo Journal of Mathematics

SN - 0387-3870

IS - 1

ER -