On Complete Atomic Proper Relation Algebras. - Frank Harary (J. Symb. Log., 1950)

Note on Carnap's Relational Asymptotic Relative Frequencies. - Frank Harary (J. Symb. Log., 1958)

Graph theory and electric networks. - Frank Harary (IRE Trans. Inf. Theory, 1959)

On the Consistency of Precedence Matrices. - Frank Harary (J. ACM, 1960)

On the computer enumeration of finite topologies. - J. W. Evans; Frank Harary; M. Stuart Lynn (Commun. ACM, 1967)

Enumeration of Finite Automata - Frank Harary; Edgar M. Palmer (Inf. Control., 1967)

A formal system for information retrieval from files. - David Hsiao; Frank Harary (Commun. ACM, 1970)

A Matrix Approach to Nonstationary Chains. - Frank Harary; Benjamin Lipstein; George P. H. Styan (Oper. Res., 1970)

The cutting center theorem for trees. - Frank Harary; Phillip A. Ostrand (Discret. Math., 1971)

On the automorphism group of a matroid. - Frank Harary; M. J. Piff; D. J. A. Welsh (Discret. Math., 1972)

Graphical enumeration. - Frank Harary; Edgar M. Palmer (Addison-Wesley, 1973)

The number of caterpillars. - Frank Harary; Allen J. Schwenk (Discret. Math., 1973)

On clique-extremal (p, q)-graphs. - Frank Harary; Abraham Lempel (Networks, 1974)

Generalized Ramsey theory for graphs IV, the Ramsey multiplicity of a graph. - Frank Harary; Geert C. E. Prins (Networks, 1974)

On the cell-growth problem for arbitrary polygons. - Frank Harary; Edgar M. Palmer; Ronald C. Read (Discret. Math., 1975)

On Tactical Configurations with No Four-Cycles. - Frank Harary; Allen J. Schwenk (J. Comb. Theory A, 1976)

Homage to george pólya. - Frank Harary (J. Graph Theory, 1977)

Editorial. - Frank Harary; Gary Chartrand (J. Graph Theory, 1977)

The biparticity of a graph. - Frank Harary; Derbiau Hsu; Zevi Miller (J. Graph Theory, 1977)

Enumeration of graphs with signed points and lines. - Frank Harary; Edgar M. Palmer; Robert W. Robinson; Allen J. Schwenk (J. Graph Theory, 1977)

The divisibility theorem for isomorphic factorizations of complete graphs. - Frank Harary; Robert W. Robinson; Nicholas C. Wormald (J. Graph Theory, 1977)

Unicyclic realizability of a degree list. - Francis T. Boesch; Frank Harary (Networks, 1978)

Generalized ramsey theory for graphs VII: Ramsey numbers for multigraphs and networks. - Frank Harary; Allen J. Schwenk (Networks, 1978)

Generalized ramsey theory for graphs, x: double stars. - Jerrold W. Grossman; Frank Harary; Maria M. Klawe (Discret. Math., 1979)

The graphs with only self-dual signings. - Frank Harary; Helene J. Kommel (Discret. Math., 1979)

Properties of almost all graphs and complexes. - Andreas Blass; Frank Harary (J. Graph Theory, 1979)

The graphs for which all strong orientations are hamiltonian. - Martin Grötschel; Frank Harary (J. Graph Theory, 1979)

On double and multiple interval graphs. - William T. Trotter; Frank Harary (J. Graph Theory, 1979)

Digraphs with real and gaussian spectra. - Friedrich Esser; Frank Harary (Discret. Appl. Math., 1980)

The smallest graphs with certain adjacency properties. - Geoffrey Exoo; Frank Harary (Discret. Math., 1980)

On the Spectrum of a Complete Multipartite Graph. - Friedrich Esser; Frank Harary (Eur. J. Comb., 1980)

Which trees are link graphs? - Andreas Blass; Frank Harary; Zevi Miller (J. Comb. Theory B, 1980)

Bigraphs versus digraphs via matrices. - Richard A. Brualdi; Frank Harary; Zevi Miller (J. Graph Theory, 1980)

Some problems in topological graph theory. - Jonathan L. Gross; Frank Harary (J. Graph Theory, 1980)

A simple algorithm to detect balance in signed graphs. - Frank Harary; Jerald A. Kabell (Math. Soc. Sci., 1980)

Monotone sequences of graphical invariants. - Frank Harary; Jerald A. Kabell (Networks, 1980)

Graph Theoretic Models. - Frank Harary (Theor. Comput. Sci., 1980)

Oriented two-dimensional circuits. - A. K. Dewdney; Frank Harary (Discret. Math., 1981)

A graph and its complement with specified properties. IV. Counting self-complementary blocks. - Jin Akiyama; Frank Harary (J. Graph Theory, 1981)

Paley graphs satisfy all first-order adjacency axioms. - Andreas Blass; Geoffrey Exoo; Frank Harary (J. Graph Theory, 1981)

Homage to the memory of Kazimierz Kuratowski. - Frank Harary (J. Graph Theory, 1981)

The cohesiveness of a point of a graph. - Jin Akiyama; Frank Boesch; Hiroshi Era; Frank Harary; Ralph Tindell (Networks, 1981)

Covering and packing in graphs IV: Linear arboricity. - Jin Akiyama; Geoffrey Exoo; Frank Harary (Networks, 1981)

Graphs as models of communication network vulnerability: Connectivity and persistence. - Frank Boesch; Frank Harary; Jerald A. Kabell (Networks, 1981)

The smallest 2-connected cubic bipartite planar nonhamiltonian graph. - Takao Asano; Nobuji Saito; Geoffrey Exoo; Frank Harary (Discret. Math., 1982)

Boolean distance for graphs. - Frank Harary; Robert A. Melter; Uri N. Peled; Ioan Tomescu (Discret. Math., 1982)

Homage to roberto frucht. - Frank Harary (J. Graph Theory, 1982)

On balance in group graphs. - Frank Harary; Bernt Lindström; Hans-olov Zetterström (Networks, 1982)

Domination alteration sets in graphs. - Douglas Bauer; Frank Harary; Juhani Nieminen; Charles L. Suffel (Discret. Math., 1983)

A tribute to Frank P. Ramsey, 1903-1930. - Frank Harary (J. Graph Theory, 1983)

In praise of paul erdös on his seventieth. - Frank Harary (J. Graph Theory, 1983)

Regular graphs with given girth pair. - Frank Harary; Peter Kovács (J. Graph Theory, 1983)

Conditional connectivity. - Frank Harary (Networks, 1983)

Isomorphic factorizations VIII: Bisectable trees. - Frank Harary; Robert W. Robinson (Comb., 1984)

The rediscovery of Redfield's papers. - Frank Harary; Robert W. Robinson (J. Graph Theory, 1984)

Digital metrics: A graph-theoretical approach. - Frank Harary; Robert A. Melter; Ioan Tomescu (Pattern Recognit. Lett., 1984)

On signed digraphs with all cycles negative. - Frank Harary; J. Richard Lundgren; John S. Maybee (Discret. Appl. Math., 1985)

On the regulation number of a multigraph. - Gary Chartrand; Frank Harary; Ortrud R. Oellermann (Graphs Comb., 1985)

The graph reconstruction number. - Frank Harary; Michael Plantholt (J. Graph Theory, 1985)

Isomorphic factorizations X: Unsolved problems. - Frank Harary; Robert W. Robinson (J. Graph Theory, 1985)

A Linear Algorithm for the Cutting Center of a Tree. - Frank Harary; Peter J. Slater (Inf. Process. Lett., 1986)

Some genuine graph models in anthropology. - Per Hage; Frank Harary (J. Graph Theory, 1986)

Editorial: Changing of the guard. - Frank Harary (J. Graph Theory, 1986)

Graph theory as applied mathematics. - Frank Harary (J. Graph Theory, 1986)

Hamiltonian threshold graphs. - Frank Harary; Uri N. Peled (Discret. Appl. Math., 1987)

The class reconstruction number of maximal planar graphs. - Frank Harary; Josef Lauri (Graphs Comb., 1987)

Embedding and characterization of quantum chemical reaction graphs on two-dimensional orientable surfaces. - Frank Harary; Paul G. Mezey (Discret. Appl. Math., 1988)

On the euclidean dimension of a wheel. - Fred Buckley; Frank Harary (Graphs Comb., 1988)

In memory of Torrence Parsons, 1941-1987. - Frank Harary (J. Graph Theory, 1988)

The Integral of a Tree. - Frank Harary (J. Inf. Sci. Eng., 1988)

On graphs with signed inverses. - Fred Buckley; Lynne L. Doty; Frank Harary (Networks, 1988)

The graph of a boolean function. - Frank Harary (J. Exp. Theor. Artif. Intell., 1989)

Classification of interpolation theorems for spanning trees and other families of spanning subgraphs. - Frank Harary; Michael Plantholt (J. Graph Theory, 1989)

Distance in graphs. - Fred Buckley; Frank Harary (Addison-Wesley, 1990)

Graph theory. - Frank Harary (Addison-Wesley, 1991)

What is the difference between the domination and independent domination numbers of a cubic graph? - Curtiss Barefoot; Frank Harary; Kathryn Fraughnaugh Jones (Graphs Comb., 1991)

Changing and Unchanging the Diameter of a Hypercube. - Niall Graham; Frank Harary (Discret. Appl. Math., 1992)

Which graphs are pluperfect? - Frank Harary; Martin Lewinter (Australas. J Comb., 1993)

Realizing the chromatic numbers of triangulations of surfaces. - Frank Harary; Serge Lawrencenko; Vladimir P. Korzhik (Discret. Math., 1993)

Edge fault tolerance in graphs. - Frank Harary; John P. Hayes (Networks, 1993)

Subcube Fault-Tolerance in Hypercubes - Niall Graham; Frank Harary; Marilynn Livingston; Quentin F. Stout (Inf. Comput., 1993)

Minimum degree games for graphs. - Daniel M. Gordon; Robert W. Robinson; Frank Harary (Discret. Math., 1994)

Sum graphs over all the integers. - Frank Harary (Discret. Math., 1994)

The square of a chordal graph. - Frank Harary; Terry A. McKee (Discret. Math., 1994)

Size in maximal triangle-free graphs and minimal graphs of diameter 2. - Curtiss Barefoot; Karen Casey; David C. Fisher; Kathryn Fraughnaugh; Frank Harary (Discret. Math., 1995)

One node fault tolerance for caterpillars and starlike trees. - Frank Harary; Mohammed Khurrum (Int. J. Comput. Math., 1995)

A Study of Maximum Unit-circle Caterpillars - Tools for the Study of the Shape of Adsorption Patterns. - Frank Harary; William Randolph; Paul G. Mezey (Discret. Appl. Math., 1996)

Nordhaus-Gaddum inequalities for domination in graphs. - Frank Harary; Teresa W. Haynes (Discret. Math., 1996)

Node fault tolerance in graphs. - Frank Harary; John P. Hayes (Networks, 1996)

The color cost of a caterpillar. - Mario Gionfriddo; Frank Harary; Zsolt Tuza (Discret. Math., 1997)

On complete systems of invariants for small graphs. - Frank Harary; Stavros D. Nikolopoulos (Int. J. Comput. Math., 1997)

Breaking Symmetry in Complete Graphs by Orienting Edges: Asymptotic Bounds. - Frank Harary; Desh Ranjan (Inf. Process. Lett., 1998)

On the out-domination and in-domination numbers of a digraph. - Gary Chartrand; Frank Harary; Bill Quan Yue (Discret. Math., 1999)

How large can the domination numbers of a graph be? - Gary Chartrand; Linda Eroh; Frank Harary; Ping Zhang 004 (Australas. J Comb., 2000)

On the Hall Number of a Graph. - Gary Chartrand; Frank Harary; Ping Zhang 004 (Ars Comb., 2000)

Double Domination in Graphs. - Frank Harary; Teresa W. Haynes (Ars Comb., 2000)

Geodetic sets in graphs. - Gary Chartrand; Frank Harary; Ping Zhang 004 (Discuss. Math. Graph Theory, 2000)

An Heuristic Algorithm for Handling Multiple Responses. - Maria Satratzemi; Constantine Tsouros; Frank Harary (J. Heuristics, 2000)

The Automorphism Group of a Hypercube. - Frank Harary (J. Univers. Comput. Sci., 2000)

Early Computer Science Adventures of a Mathematician. - Frank Harary (DMTCS, 2001)

A Symmetric Strategy in Graph Avoidance Games - Frank Harary; Wolfgang Slany; Oleg Verbitsky 001 (CoRR, 2001)

Destroying symmetry by orienting edges: Complete graphs and complete bigraphs. - Frank Harary; Michael S. Jacobson (Discuss. Math. Graph Theory, 2001)

A new graph characteristic and its application to numerical computability. - Frank Harary; Vladik Kreinovich; Luc Longpré (Inf. Process. Lett., 2001)

On the Maximum Number of Cyclic Triples in Oriented Graphs. - Lowell W. Beineke; Frank Harary (J. Comb. Theory B, 2001)

A constraint logic programming approach for generating all perfect matchings. - Frank Harary; Gopal Gupta 001 (Appl. Math. Lett., 2002)

Unsolved Problems on Distance in Graphs. - Fred Buckley; Frank Harary (Electron. Notes Discret. Math., 2002)

A Radio Coloring of a Hypercube. - Ophir Frieder; Frank Harary; Peng-Jun Wan (Int. J. Comput. Math., 2002)

On the geodetic number of a graph. - Gary Chartrand; Frank Harary; Ping Zhang 004 (Networks, 2002)

Preface. - Frank Harary (Discret. Math., 2003)

Edge Sums of Debruijn Interconnection Networks. - Daniela Ferrero; Frank Harary (Int. J. Comput. Math., 2003)

Algorithms for derivation of structurally stable Hamiltonian signed graphs. - Frank Harary; Meng-Hiot Lim; Amit Agarwal 006; Donald C. Wunsch (Int. J. Comput. Math., 2004)

On the lengths of symmetry breaking-preserving games on graphs. - Frank Harary; Wolfgang Slany; Oleg Verbitsky 001 (Theor. Comput. Sci., 2004)

On the Computational Complexity of the Forcing Chromatic Number. - Frank Harary; Wolfgang Slany; Oleg Verbitsky 001 (STACS, 2005)

Identity orientation of complete bipartite graphs. - Frank Harary; Desh Ranjan (Discret. Math., 2005)

Destroying automorphisms by fixing nodes. - David Erwin; Frank Harary (Discret. Math., 2006)