Multiplicity of finite graphs over the real Line

Shosaku Matsuzaki

Multiplicity of finite graphs over the real Line

Shosaku Matsuzaki^*

^*Corresponding author for this work

Graduate School of Teacher Education

Research output: Contribution to journal › Article › peer-review

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 : R¹) of a finite graph G over the real line R¹ is equal to the cutwidth of G. We give a lower bound of m(G : R¹) and determine m(G : R¹) for an n-constructed graph G.

Original language	English
Pages (from-to)	247-256
Number of pages	10
Journal	Tokyo Journal of Mathematics
Volume	37
Issue number	1
Publication status	Published - 2014 Jun 1

Keywords

Cutwidth
Edge-connectivity
Finite graph
Multiplicity

ASJC Scopus subject areas

Mathematics(all)

Cite this

@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 = jun,

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

AN - SCOPUS:84908080553

SN - 0387-3870

VL - 37

SP - 247

EP - 256

JO - Tokyo Journal of Mathematics

JF - Tokyo Journal of Mathematics

IS - 1

ER -

Multiplicity of finite graphs over the real Line

Abstract

Keywords

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this