On equality of edge-connectivity and minimum degree of a graph
Archivum Mathematicum (1989)
- Volume: 025, Issue: 1-2, page 19-25
- ISSN: 0044-8753
Access Full Article
top
How to cite
topPlesník, Ján, and Znám, Štefan. "On equality of edge-connectivity and minimum degree of a graph." Archivum Mathematicum 025.1-2 (1989): 19-25. <http://eudml.org/doc/18254>.
@article{Plesník1989,
author = {Plesník, Ján, Znám, Štefan},
journal = {Archivum Mathematicum},
keywords = {edge-connectivity; minimum degree; distance; bipartite graphs},
language = {eng},
number = {1-2},
pages = {19-25},
publisher = {Department of Mathematics, Faculty of Science of Masaryk University, Brno},
title = {On equality of edge-connectivity and minimum degree of a graph},
url = {http://eudml.org/doc/18254},
volume = {025},
year = {1989},
}
TY - JOUR
AU - Plesník, Ján
AU - Znám, Štefan
TI - On equality of edge-connectivity and minimum degree of a graph
JO - Archivum Mathematicum
PY - 1989
PB - Department of Mathematics, Faculty of Science of Masaryk University, Brno
VL - 025
IS - 1-2
SP - 19
EP - 25
LA - eng
KW - edge-connectivity; minimum degree; distance; bipartite graphs
UR - http://eudml.org/doc/18254
ER -
References
top- M. Behzad G. Chartrand, L. Lesniak-Foster, Graphs and Digraphs, Prindle, Weber and Schmidt, Boston, 1979. (1979) MR0525578
- B. Bollobás, On graphs with equal edge connectivity and minimum degree, Discrete Math. 28 (1979), 321-323. (1979) MR0548631
- G. Chartrand, A graph-theoretical approach to a communications problem, SIAM J. Appl. Math. 14 (1966), 778-781. (1966) MR0207585
- A. H. Esfahanian, Lower bounds on the connectivities of a graph, J. Graph Theory 9 (1985), 503-511. (1985) Zbl0664.05050MR0890241
- D. L. Goldsmith, R. C. Entringer, A sufficient condition for equality of edge-connectivity and minimum degree of a graph, J. Graph Theory 3 (1979), 251-255. (1979) Zbl0417.05040MR0542546
- L. Lesniak, Results on the edge-connectivity of graphs, Discrete Math. 8 (1974), 351-354. (1974) Zbl0277.05123MR0335333
- J. Plesník, Critical graphs of given diameter, Acta Fac. R. N. Univ. Comen. Math. 30 (1975), 71-93. (1975) MR0398904
- T. Soneoka H. Nakada M. Imase, C. Peyrat, Sufficient conditions for maximally connected dense graphs, preprint. MR0874923
- L. Volkmann, Bemerkungen zum p-fachen Kantenzusammenhang von Graphen, An. Univ. Bucuresti Mat., to appear. Zbl0649.05046MR0978449
- L. Volkmann, Edge-connectivity in partite graphs, J. Graph Theory, to appear.
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.