The Maximum Genus of a Graph with Given Diameter and Connectivity

Hung-Lin Fu*, Ming Chun Tsai

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-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 languageEnglish
Pages (from-to)322-329
Number of pages8
JournalElectronic Notes in Discrete Mathematics
Volume11
DOIs
StatePublished - 1 Jul 2002

Keywords

  • Betti deficiency
  • Maximum genus
  • diameter and connectivity

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