О степенях вершин почти всех графов
Verojatnostnye metody i kibernetika (1980)
- Volume: 16, page 83-90
- ISSN: 0132-2869
Access Full Article
top
How to cite
topНурмеев, Н.Н.. "О степенях вершин почти всех графов." Verojatnostnye metody i kibernetika 16 (1980): 83-90. <http://eudml.org/doc/69193>.
@article{Нурмеев1980,
author = {Нурмеев, Н.Н.},
journal = {Verojatnostnye metody i kibernetika},
keywords = {degree; minimum; maximum; unoriented graphs; oriented graphs},
language = {rus},
pages = {83-90},
publisher = {Izd. Kazanskogo universiteta},
title = {О степенях вершин почти всех графов},
url = {http://eudml.org/doc/69193},
volume = {16},
year = {1980},
}
TY - JOUR
AU - Нурмеев, Н.Н.
TI - О степенях вершин почти всех графов
JO - Verojatnostnye metody i kibernetika
PY - 1980
PB - Izd. Kazanskogo universiteta
VL - 16
SP - 83
EP - 90
LA - rus
KW - degree; minimum; maximum; unoriented graphs; oriented graphs
UR - http://eudml.org/doc/69193
ER -
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.