Vertex Degree Sequences of Graphs With Small Number of Circuits
Publications de l'Institut Mathématique, _N_S_46 (1989) no. 60, p. 7
Voir la notice de l'article provenant de la source eLibrary of Mathematical Institute of the Serbian Academy of Sciences and Arts
Necessary and sufficient conditions are determined for the
numbers $p_1,p_2,\ldots,p_n$ to be the vertex degrees of a connected
graph with $n$ vertices and cyclomatic number $c$, $c=0,1,2,3,4,5$.
Classification :
05C75
@article{PIM_1989_N_S_46_60_a1,
author = {Ivan Gutman},
title = {Vertex {Degree} {Sequences} of {Graphs} {With} {Small} {Number} of {Circuits}},
journal = {Publications de l'Institut Math\'ematique},
pages = {7 },
publisher = {mathdoc},
volume = {_N_S_46},
number = {60},
year = {1989},
language = {en},
url = {http://geodesic.mathdoc.fr/item/PIM_1989_N_S_46_60_a1/}
}
Ivan Gutman. Vertex Degree Sequences of Graphs With Small Number of Circuits. Publications de l'Institut Mathématique, _N_S_46 (1989) no. 60, p. 7 . http://geodesic.mathdoc.fr/item/PIM_1989_N_S_46_60_a1/