Дискретно-непрерывная математика (стр. 101 )

34. Gomery R. E., Ни Т. С., Multi-terminal Network Flows. J. Soc. Ind. Appl. Math., 9; 551—570 (1961).

35. H u Т. С, Multi-commodity Network Flows. Operations Res., 11: 344—360 (1963).

36. Jewell W. S., Optimal Flow through Networks. MIT Interim Tech. Rept 8, 1958.

37. Saaty T. L., Elements of Queueing Theory. McGraw-Hill Book Company, New York, 1961. [Русск. перев.: С а а т и Т., Элементы теории массового обслуживания и её приложения. «Советское радио». 1965.]

38. As lib у W. R., An Introduction to Cybernetics. John Wiley & Sons, Inc., New York, 1956. [Русск. перев.: Введе­ние в кибернетику, ИЛ, 1959.]

39. Вепгег S., On the Topology of the Genetic Fine Structure. Proc. Nat!. Acad. Sci. U. S., 45: 1607—1620 (1959).

40. Berge C, Two Theorems in Graph Theory. Proc. Nat!., Acad., Sci. U. S., 43: 842—844 (+957).

41. В loch A., On Methods for the Construction of Networks Dual to Nonplanar Networks. Proc. Phys. Soc. (London), 58: 677—694 (1946).

42. Bose R. G., Paired Comparison Designs for Testing Concor­dance between Judges. Biometrika, 43: 113—121 (1956).

43. Bose R. C. Strongly Regular Graphs, Partial Geometries and Partially Balanced Designs. Pacific J. Math., 13: 389—419 (1963).

44. Bose R. C, Shimamoto Т., Classification and Analysis of Partially Balanced Incomplete Block Designs. J. Am. Statistics Assoc, 47: 151—184 (1952).

45. В о 11 R., M а у b e г г у J. P., Matrices and Tress, in O. Mor-genstern. «Economic Activity Analysis», pp: 391—400: John Wiley & Sons, Inc., New York, 1954.

46. В г у a n t P. R., The Algebra and Topology of Electrical Net­works. Proc. Inst. Elec. Engrs: (London), C108: 215—229 (1961 )i MR 22-1801.

47 Carteblanche F. de, Pile of Cubes. Eureka, April, 1947.

47. Cay ley E., Uber die Analytischen Figuren Welche in der Mathennitic Baume genannt werden und ihre Anwendung auf die Theorie chemischer Bervindungen. Ber., 8; 1056 (1875).

49. Chien R. Т., Synthesis of a Communication Net. IBM J: Res: Develop., 4. 311—320 (1960). MR 22—2276.

50. Cherry E. C, Generalized Concepts of Networks. Proc. Syinp: works, Polytechnic Institute of Brooklyn 1955, pp. 175—184. MR 16—1077.

51. Clarke L. E., On Cayley's Formula for Counting Trees. J. Lon­don Math Soc, 33: 471—474 (1958). MR 20—1193.

52. Clarke L. E., On Otter's Formula for Enumerating Trees. Quart. J. Math. Oxford, Ser. 2, 10: 43—45 (1959). MR 21—623.

53. С rowel I R. H., Graphs of Linear Transformations over Finite Fields, J. Soc. Ind. Appl: Math:, 10 (1): 103—112 (1962):

54. Dulmage A. L., Mendelsohn N. S., The Characteristic Equation of an Imprimitive Matrix. J. Soc. Ind. Appl. Math., 11: 1034 (1963),

55. E d m о n d s J., J. Res.. Natl. Bur. Std. B, 69: (1965).

56. Edmonds J., Maximal Matching and a Polyhedron with 0, 1-Vertices. Natl. Bur. Std. Rept., 1963 (Mimeographed).

57. Edmonds J., Paths, Trees, and Flowers. Natl. Bur. Std. Rept., 1964 (Mimeographed),

58. Feller W., An Introduction to Probability Theory and Its Appli­cations. John Wiley & Sons, Inc., New York, 1957. [Русск. перев.: Введение в теорию вероятностей и её применения. «Мир», 1967.]

59. Ford L. R., Jr., Fulkerson D. R., Flows in Networks. Prin­ceton University Press. Princeton, N. J., 1962 [Русск. перев.: Потоки в сетях. «Мир», 1968.]

60 Ford L R., Jr. Johnson S. M.. A Tournament Problem. Am. Math. Monthly, 66; 387—389 (1959).

61 Fulkerson D. R., Expected Critical Path Lengths in PERT Networks. Operations Res., 10: 808—818 (1962).

62 Fulkerson D. R. Gross O. A., Incidence Matrices and Interval Graphs. RAND Project 1057.

63. Gaffrtey M., European Sci. Notes, Office Naval Res., Lon­don, 17—24, 22 April, 1963.

64. Gardner M., Mathematical Games. Sci. Am., pp. 124, 129, October, 1958.

65. G a r d n e r M., Mathematical Games Sci. Am., pp. 150, 152, July,

1961 29 Gilbert E. N., Enumeration of Labelled Graphs. Can. J. Alath..

6: 405—411 (1956).

66. Gil! A., Introduction to the Theory of Finite-state Machines. McGraw-Hill Book Company, New York, 1962.

67. Gil more P. C, Hoffman A. J., A Characterization of Comparability Graphs and of Interval Graphs. Can. J. Math., 16; 539—548 (1964).

68. Ginsburg S., An Introduction to Mathematical Machine Theory, Addison — Wesley Publishing Company, Inc., Reading, Mass, 1962.

69. G i о s s m a n ]., Magnus W.. Groups and Their Graphs, Random House, Inc., New York, 1964.

70. G г u n b a u m В., Motzkin T. S,, Longest Simple Paths in Polyhedral Graphs, J. London Math. Soc, 152—160 (1962)

71. G u i I 1 e rn i л Ё. A., How to Grow Your Own Trees from Given Cut-set or Tie-set Matrices. IRE Trans. Circuit Theory, CT-6

(spec, suppl.): 110—126 (1959).

72. Guy R. K., A Combinatorial Problem. Bull. Malayan Math., Soc, 7: 68—72 (I960).

73. H a r a r у F. Ом Local Balance and n-Balance in Signed Graphs. Aljch. Math J., 3: 37—41 (1955).

74. H a r a r у F., Ross Ian C. A Procedure for Clique Detection Using the Group Matrix. Sociometry, 20 (2): 205—215 (1957).

75. Harary F., Graph Theoretic Methods in the Management Scien­ces. Management Sci., 5 (4): 387—403 (1959).

76. Harary F., Some Historical and Intuitive Aspects of Graph Theory. SI AM Rev.. 2 (2): 123—131 (I960).

77. Harary F.. Note on the Polya and Otter Formulas for Enume­rating Trees Mich. Math. J., 3: 109—112 (1956), MR 17—1231.

78. H arary F., Graph Theory, in «Encyclopedia of Science aiid Technology», vol. 6, pp. 253—256, McGraw-Hill Book Company, New York, 1960.

79. Harary F., A Matrix Criterion for Structural Balance. Naval Res Logistics Quart.. 7 (2): 195—199 (1960),

80 H a r a r у F., Unsolved Problems in the Theory of Graphs. Publ. Math Inst. Hung, Acad. Sci., Ser. A, 5: 63—95 (I960).

81. H a t a r у F., The Number of Linear, Directed, Rooted, and Con­nected Graphs. Trans. Am. Math, Soc, 78: 445—463 (1955),

82, H a r a r у F., Hill A., On the Number of Crossings in a Com­plete Graph. Proc Edinburgh Math. Soc, 13: 333—338 (1963.)

83 Heise G. H., Miller O. A., Problem Solving by Small Groups Using Various Communication Nits. J. Abnormal Psych., 46: (1951).

84. Hohn F., St me Mathematical Aspects of Switching. Am. Math. Monthly. 62: 75-90 (1455).

85 H о f f m a n A. J., On the Polynomial of a Graph, Am. Math. Monthly, 70 (I): 30—36 (1963).

86. H о f f m a n A. J., Some Recent Applications of the Theory of Lineal Inequalities to Extremal Combinatorial Analysis. Proc. Symp. Appl. Math., 10^315—319 (1959).

87. H о f f m а и A. J., Gomory R.. Finding Optimum Combina­tions. Intern. Sci. Tech., pp. 26—33, July, 1962.

⨪