The extremal connectivity of the strictly weak digraph
Mathematica Slovaca (1976)
- Volume: 26, Issue: 2, page 115-118
- ISSN: 0232-0525
Access Full Article
top
How to cite
topMikola, Milan. "The extremal connectivity of the strictly weak digraph." Mathematica Slovaca 26.2 (1976): 115-118. <http://eudml.org/doc/33979>.
@article{Mikola1976,
author = {Mikola, Milan},
journal = {Mathematica Slovaca},
language = {eng},
number = {2},
pages = {115-118},
publisher = {Mathematical Institute of the Slovak Academy of Sciences},
title = {The extremal connectivity of the strictly weak digraph},
url = {http://eudml.org/doc/33979},
volume = {26},
year = {1976},
}
TY - JOUR
AU - Mikola, Milan
TI - The extremal connectivity of the strictly weak digraph
JO - Mathematica Slovaca
PY - 1976
PB - Mathematical Institute of the Slovak Academy of Sciences
VL - 26
IS - 2
SP - 115
EP - 118
LA - eng
UR - http://eudml.org/doc/33979
ER -
References
top- HARARY F., Graph Theory, Reading, Massachusetts, 1969. (1969) Zbl0196.27202MR0256911
- HARARY F., The maximum connectivity of a graph, Proc. Nat. Acad. Sci. 1. 1969 1142-1146. (1969) MR0137663
- MIKOLA M., The maximum and minimum connectivity of a digraph, In.: Prác a štúdie VŠD 1, 1974, 13-19. (1974) MR0406854
- CARTWRIGHT D., HARARY F., The number of lines in a graph of each connectedness category, SIAM Rew. 3, 1961, 309-314. (1961) MR0179100
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.