Frank Harary

According to our database1, Frank Harary authored at least 115 papers between 1950 and 2007.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.



In proceedings 
PhD thesis 


Online presence:



On the Computational Complexity of the Forcing Chromatic Number.
SIAM J. Comput., 2007

Destroying automorphisms by fixing nodes.
Discret. Math., 2006

Identity orientation of complete bipartite graphs.
Discret. Math., 2005

On the lengths of symmetry breaking-preserving games on graphs.
Theor. Comput. Sci., 2004

Algorithms for derivation of structurally stable Hamiltonian signed graphs.
Int. J. Comput. Math., 2004

Edge Sums of Debruijn Interconnection Networks.
Int. J. Comput. Math., 2003

Discret. Math., 2003

On the geodetic number of a graph.
Networks, 2002

A Radio Coloring of a Hypercube.
Int. J. Comput. Math., 2002

Unsolved Problems on Distance in Graphs.
Electron. Notes Discret. Math., 2002

A constraint logic programming approach for generating all perfect matchings.
Appl. Math. Lett., 2002

On the Maximum Number of Cyclic Triples in Oriented Graphs.
J. Comb. Theory B, 2001

A new graph characteristic and its application to numerical computability.
Inf. Process. Lett., 2001

Destroying symmetry by orienting edges: Complete graphs and complete bigraphs.
Discuss. Math. Graph Theory, 2001

A Symmetric Strategy in Graph Avoidance Games
CoRR, 2001

Early Computer Science Adventures of a Mathematician.
Proceedings of the Combinatorics, 2001

The Automorphism Group of a Hypercube.
J. Univers. Comput. Sci., 2000

An Heuristic Algorithm for Handling Multiple Responses.
J. Heuristics, 2000

Geodetic sets in graphs.
Discuss. Math. Graph Theory, 2000

Double Domination in Graphs.
Ars Comb., 2000

On the Hall Number of a Graph.
Ars Comb., 2000

How large can the domination numbers of a graph be?
Australas. J Comb., 2000

On the out-domination and in-domination numbers of a digraph.
Discret. Math., 1999

Breaking Symmetry in Complete Graphs by Orienting Edges: Asymptotic Bounds.
Inf. Process. Lett., 1998

On complete systems of invariants for small graphs.
Int. J. Comput. Math., 1997

The color cost of a caterpillar.
Discret. Math., 1997

Node fault tolerance in graphs.
Networks, 1996

Nordhaus-Gaddum inequalities for domination in graphs.
Discret. Math., 1996

A Study of Maximum Unit-circle Caterpillars - Tools for the Study of the Shape of Adsorption Patterns.
Discret. Appl. Math., 1996

One node fault tolerance for caterpillars and starlike trees.
Int. J. Comput. Math., 1995

Size in maximal triangle-free graphs and minimal graphs of diameter 2.
Discret. Math., 1995

The square of a chordal graph.
Discret. Math., 1994

Sum graphs over all the integers.
Discret. Math., 1994

Minimum degree games for graphs.
Discret. Math., 1994

Subcube Fault-Tolerance in Hypercubes
Inf. Comput., February, 1993

Edge fault tolerance in graphs.
Networks, 1993

Realizing the chromatic numbers of triangulations of surfaces.
Discret. Math., 1993

Which graphs are pluperfect?
Australas. J Comb., 1993

Changing and Unchanging the Diameter of a Hypercube.
Discret. Appl. Math., 1992

What is the difference between the domination and independent domination numbers of a cubic graph?
Graphs Comb., 1991

Graph theory.
Addison-Wesley, ISBN: 978-0-201-02787-7, 1991

Distance in graphs.
Addison-Wesley, ISBN: 978-0-201-09591-3, 1990

Classification of interpolation theorems for spanning trees and other families of spanning subgraphs.
J. Graph Theory, 1989

The graph of a boolean function.
J. Exp. Theor. Artif. Intell., 1989

On graphs with signed inverses.
Networks, 1988

The Integral of a Tree.
J. Inf. Sci. Eng., 1988

In memory of Torrence Parsons, 1941-1987.
J. Graph Theory, 1988

On the euclidean dimension of a wheel.
Graphs Comb., 1988

Embedding and characterization of quantum chemical reaction graphs on two-dimensional orientable surfaces.
Discret. Appl. Math., 1988

The class reconstruction number of maximal planar graphs.
Graphs Comb., 1987

Hamiltonian threshold graphs.
Discret. Appl. Math., 1987

Graph theory as applied mathematics.
J. Graph Theory, 1986

Editorial: Changing of the guard.
J. Graph Theory, 1986

Some genuine graph models in anthropology.
J. Graph Theory, 1986

A Linear Algorithm for the Cutting Center of a Tree.
Inf. Process. Lett., 1986

Isomorphic factorizations X: Unsolved problems.
J. Graph Theory, 1985

The graph reconstruction number.
J. Graph Theory, 1985

On the regulation number of a multigraph.
Graphs Comb., 1985

On signed digraphs with all cycles negative.
Discret. Appl. Math., 1985

Digital metrics: A graph-theoretical approach.
Pattern Recognit. Lett., 1984

The rediscovery of Redfield's papers.
J. Graph Theory, 1984

Isomorphic factorizations VIII: Bisectable trees.
Comb., 1984

Conditional connectivity.
Networks, 1983

Regular graphs with given girth pair.
J. Graph Theory, 1983

In praise of paul erdös on his seventieth.
J. Graph Theory, 1983

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

Domination alteration sets in graphs.
Discret. Math., 1983

On balance in group graphs.
Networks, 1982

Homage to roberto frucht.
J. Graph Theory, 1982

Boolean distance for graphs.
Discret. Math., 1982

The smallest 2-connected cubic bipartite planar nonhamiltonian graph.
Discret. Math., 1982

Graphs as models of communication network vulnerability: Connectivity and persistence.
Networks, 1981

Covering and packing in graphs IV: Linear arboricity.
Networks, 1981

The cohesiveness of a point of a graph.
Networks, 1981

Homage to the memory of Kazimierz Kuratowski.
J. Graph Theory, 1981

Paley graphs satisfy all first-order adjacency axioms.
J. Graph Theory, 1981

A graph and its complement with specified properties. IV. Counting self-complementary blocks.
J. Graph Theory, 1981

Oriented two-dimensional circuits.
Discret. Math., 1981

Graph Theoretic Models.
Theor. Comput. Sci., 1980

Monotone sequences of graphical invariants.
Networks, 1980

A simple algorithm to detect balance in signed graphs.
Math. Soc. Sci., 1980

Some problems in topological graph theory.
J. Graph Theory, 1980

Bigraphs versus digraphs via matrices.
J. Graph Theory, 1980

Which trees are link graphs?
J. Comb. Theory B, 1980

On the Spectrum of a Complete Multipartite Graph.
Eur. J. Comb., 1980

The smallest graphs with certain adjacency properties.
Discret. Math., 1980

Digraphs with real and gaussian spectra.
Discret. Appl. Math., 1980

On double and multiple interval graphs.
J. Graph Theory, 1979

The graphs for which all strong orientations are hamiltonian.
J. Graph Theory, 1979

Properties of almost all graphs and complexes.
J. Graph Theory, 1979

The graphs with only self-dual signings.
Discret. Math., 1979

Generalized ramsey theory for graphs, x: double stars.
Discret. Math., 1979

Generalized ramsey theory for graphs VII: Ramsey numbers for multigraphs and networks.
Networks, 1978

Unicyclic realizability of a degree list.
Networks, 1978

The divisibility theorem for isomorphic factorizations of complete graphs.
J. Graph Theory, 1977

Enumeration of graphs with signed points and lines.
J. Graph Theory, 1977

The biparticity of a graph.
J. Graph Theory, 1977

J. Graph Theory, 1977

Homage to george pólya.
J. Graph Theory, 1977

On Tactical Configurations with No Four-Cycles.
J. Comb. Theory A, 1976

On the cell-growth problem for arbitrary polygons.
Discret. Math., 1975

Generalized Ramsey theory for graphs IV, the Ramsey multiplicity of a graph.
Networks, 1974

On clique-extremal (p, q)-graphs.
Networks, 1974

The number of caterpillars.
Discret. Math., 1973

Graphical enumeration.
Addison-Wesley, ISBN: 978-0-12-324245-7, 1973

On the automorphism group of a matroid.
Discret. Math., 1972

The cutting center theorem for trees.
Discret. Math., 1971

A Matrix Approach to Nonstationary Chains.
Oper. Res., 1970

A formal system for information retrieval from files.
Commun. ACM, 1970

Enumeration of Finite Automata
Inf. Control., May, 1967

On the computer enumeration of finite topologies.
Commun. ACM, 1967

On the Consistency of Precedence Matrices.
J. ACM, 1960

Graph theory and electric networks.
IRE Trans. Inf. Theory, 1959

Note on Carnap's Relational Asymptotic Relative Frequencies.
J. Symb. Log., 1958

On Complete Atomic Proper Relation Algebras.
J. Symb. Log., 1950