On the number of cycles in a graph
Mathematica slovaca, Tome 21 (1971) no. 1, pp. 55-63
@article{MASLO_1971_21_1_a5,
author = {Harary, Frank and Manvel, Bennet},
title = {On the number of cycles in a graph},
journal = {Mathematica slovaca},
pages = {55--63},
year = {1971},
volume = {21},
number = {1},
mrnumber = {0309800},
zbl = {0209.55404},
language = {en},
url = {http://geodesic.mathdoc.fr/item/MASLO_1971_21_1_a5/}
}
Harary, Frank; Manvel, Bennet. On the number of cycles in a graph. Mathematica slovaca, Tome 21 (1971) no. 1, pp. 55-63. http://geodesic.mathdoc.fr/item/MASLO_1971_21_1_a5/
[1] Caгtwright D., Gleason T. C.: The number of paths and cycles in a digraph. Psychometrika 31 (1966), 179-199. | MR
[2] Harary F.: Graph Theory. Addison-Wesley, Reading, Mass. 1969. | MR | Zbl
[З] Harary F., Norman R. Z., Cartwright D.: Structural models: an introduction to the theory of directed graphs. Wiley, New York, 1965. | MR | Zbl
[4] Parthasarathy K.: Enumeration of paths in digraphs. Psychometгika 29 (1964), 153 165. | MR | Zbl
[5] Ross I. C., Harary F.: On the determination of redundancies in sociometric chains. Psychometrika 17 (1952), 195 208. | Zbl