DMGT

ISSN 1234-3099 (print version)

ISSN 2083-5892 (electronic version)

https://doi.org/10.7151/dmgt

Discussiones Mathematicae Graph Theory

Journal Impact Factor (JIF 2023): 0.5

5-year Journal Impact Factor (2023): 0.6

CiteScore (2023): 2.2

SNIP (2023): 0.681

Discussiones Mathematicae Graph Theory

Article in volume

Authors:

A. Bickle

Allan Bickle

University of Tennessee

email: abickle@utk.edu

0000-0002-7739-607X

A. Schwenk

Allen Schwenk

Western Michigan University-retired

email: schwenk@wmich.edu

Title:

Corrigendum to "Minimum edge cuts in diameter 2 graphs"

PDF

Source:

Discussiones Mathematicae Graph Theory 45(1) (2025) 411-414

Received: 2023-04-17 , Revised: 2023-08-30 , Accepted: 2023-08-30 , Available online: 2023-09-23 , https://doi.org/10.7151/dmgt.2517

Abstract:

In [Minimum edge cuts in diameter $2$ graphs, Discuss. Math. Graph Theory 39 (2) (2019) 605–608] we proved several results on the structure of diameter 2 graphs with a nontrivial minimum edge cut. An error led to several results being incorrect. Here we state and prove the corresponding correct results.

Keywords:

edge connectivity, diameter

References:

  1. A. Bickle and A. Schwenk, Minimum edge cuts in diameter $2$ graphs, Discuss. Math. Graph Theory 39 (2019) 605–608.
    https://doi.org/10.7151/dmgt.2097
  2. G. Chartrand and L. Lesniak, Graphs and Digraphs, 4th Ed. (CRC Press, Boca Raton, 2005).
  3. J. Plesnik, Critical graphs of a given diameter, Acta Fac. Rerum Natur. Univ. Comenian. Math. 30 (1975) 71–93.
Close