Harary

Schneir J, Harary H H, Dagata J A, Hansma P Kand Sonnenfeld R 1989 Scanning tunneling microscopy and fabrication of nanometer scale structure at the liquid-gold interface Scanning Microsc. 3 719... 

F. Harary, Graph Theory, Addison-Wesley, Reading, MA, 1971. 

In 1967 Harary presented a proof of Polya s Theorem in Chapter 4 of his book [HarF67], and in the following chapter gave some applications. Four years later in Chapter 15 of "Graph Theory" [HarF71] he again gave an exposition of Polya s Theorem and some developments of it. 

A series of four papers by G. W. Ford and others [ForG56,56a,56b, 57] amplified this work by using Polya s Theorem to enumerate a variety of graphs on both labelled and unlabelled vertices. These included connected graphs, stars (blocks) of given homeomorphic type, and star trees. In addition many asymptotic results were derived. The enumeration of series-parallel graphs followed in 1956 [CarL56], and in that and subsequent years Harary produced... 

HarF55 Harary, F. The number of linear, directed, rooted and connected graphs. Trans. Amer. Math. Soc. 78 (1955) 445-463. 

HarF56 Harary, F. On the number of dissimilar line-subgraphs of a given graph. Pacific J. Math. 6 (1956). 

HarF57 Harary, F. The number of oriented graphs, Michigan Math. J. 4 (1957) 221-224. 

HarF60 Harary, F. Unsolved problems in the enumeration of graphs. Proc. Math. Inst. Hung. Acad. Sci. Ser A 5 (1960) 63-95. 

HarF64 Harary, F. Combinatorial problems in graphical enumeration. Applied Combinatorial Mathematics (E. F. Beckenbach, ed.) Wiley, New York (1964) 185-217. 

HarF66 Harary, F., Palmer, E. M The power group enumeration theorem. J. Comb. Theory 1 (1966) 157-173. 

HarF67 Harary, F. A proof of Polya s enumeration theorem. A seminar in graph theory. (F. Harary, ed.) Holt, Rinehart and Winston, New York (1967) 21-24. 

HarF70 Harary, F., Read, R. C. Enumeration of tree-like polyhexes. Proc. Edin. Math. Soc. Ser. II 17 (1970) 1-13. 

HarF70a Harary, F. Enumeration under group action Unsolved problems in graphical enumeration IV. J. Combinatorial Theory 8 (1970) 1-11 9 (1970) 221. 

HarF75 Harary, F., Robinson, R. W. The number of achiral trees. J. Reine Angen. Math. (1975). 

HarF75b Harary, F. Twenty step algorithm for determining the asymptotic number of trees of various species. J. Austral. Math. Soc. 20 (1975) 483-503. 

Graph Theory and Theoretical Physics (F. Harary, ed.) Academic Press, 1968. 

B. Garcia, P. Barboux, F. Ribot, A. Kahn-Harari, L. MazeroIIes, N. Baffler, Solid State Ionics 1995, 80, 111. 

Harari PM (2004) Epidermal growth factor receptor inhibition strategies in oncology. Endocr. Relat. Cancer 11 689-708... 

Harari S, Caminati A. Idiopathic pulmonary fibrosis. Allergy 2005 60(4) 421 435. 

Serres, Michael.Hermes literature, science, philosophy. Edited by Josue V. Harari and David F. Bell. Translated by Josue V. Harari and David F. Bell. Baltimore , 1982. 

---