论文信息 - Relations between graphs and integer-pair sequences

Relations between graphs and integer-pair sequences

In this paper a relation between graphs and finite integer-pair sequences is established. Necessary and sufficient conditions under which a given finite sequence of pairs of integers can realize a graph are found. Results are extended to diagraphs.

S. Louis Hakimi | A. N. Patrinos

[1] S. Hakimi. On the degrees of the vertices of a directed graph , 1965 .

[2] S. Louis Hakimi,et al. A Graph-Theoretic Approach to a Class of Integer-Programming Problems , 1969, Oper. Res..

[3] S. L. Hakimi,et al. On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph II. Uniqueness , 1963 .

[4] S. Hakimi. On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I , 1962 .

[5] J. K. Senior. Partitions and Their Representative Graphs , 1951 .

[6] Frank Harary,et al. Graph Theory , 2016 .

[7] T. B. Boffey,et al. Applied Graph Theory , 1973 .