The Maximum Genus of a Graph with Given Diameter and Connectivity

Hung-Lin Fu; Ming Chun Tsai

doi:10.1016/S1571-0653(04)00076-9

The Maximum Genus of a Graph with Given Diameter and Connectivity

Hung-Lin Fu^*, Ming Chun Tsai

^*Corresponding author for this work

Department of Applied Mathematics

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

Abstract

In this paper, we first review some of the known results about the maximum genus of a graph with given diameter or (and) connectivity. Then we prove that a 3-connected diameter 4 multigraph has Betti deficiency at most 2. Furthermore, we show this upper bound is sharp.

Original language	English
Pages (from-to)	322-329
Number of pages	8
Journal	Electronic Notes in Discrete Mathematics
Volume	11
DOIs	https://doi.org/10.1016/S1571-0653(04)00076-9
State	Published - 1 Jul 2002

Keywords

Betti deficiency
Maximum genus
diameter and connectivity

Access to Document

10.1016/S1571-0653(04)00076-9

Fingerprint Dive into the research topics of 'The Maximum Genus of a Graph with Given Diameter and Connectivity'. Together they form a unique fingerprint.

Cite this

@article{f0dd66588e7040329075d35ab18313d0,

title = "The Maximum Genus of a Graph with Given Diameter and Connectivity",

abstract = "In this paper, we first review some of the known results about the maximum genus of a graph with given diameter or (and) connectivity. Then we prove that a 3-connected diameter 4 multigraph has Betti deficiency at most 2. Furthermore, we show this upper bound is sharp.",

keywords = "Betti deficiency, Maximum genus, diameter and connectivity",

author = "Hung-Lin Fu and Tsai, {Ming Chun}",

year = "2002",

month = jul,

day = "1",

doi = "10.1016/S1571-0653(04)00076-9",

language = "English",

volume = "11",

pages = "322--329",

journal = "Electronic Notes in Discrete Mathematics",

issn = "1571-0653",

publisher = "Elsevier",

}

TY - JOUR

T1 - The Maximum Genus of a Graph with Given Diameter and Connectivity

AU - Fu, Hung-Lin

AU - Tsai, Ming Chun

PY - 2002/7/1

Y1 - 2002/7/1

N2 - In this paper, we first review some of the known results about the maximum genus of a graph with given diameter or (and) connectivity. Then we prove that a 3-connected diameter 4 multigraph has Betti deficiency at most 2. Furthermore, we show this upper bound is sharp.

AB - In this paper, we first review some of the known results about the maximum genus of a graph with given diameter or (and) connectivity. Then we prove that a 3-connected diameter 4 multigraph has Betti deficiency at most 2. Furthermore, we show this upper bound is sharp.

KW - Betti deficiency

KW - Maximum genus

KW - diameter and connectivity

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

U2 - 10.1016/S1571-0653(04)00076-9

DO - 10.1016/S1571-0653(04)00076-9

M3 - Article

AN - SCOPUS:34247123322

VL - 11

SP - 322

EP - 329

JO - Electronic Notes in Discrete Mathematics

JF - Electronic Notes in Discrete Mathematics

SN - 1571-0653

ER -