Frank Harary

117 papers A 1Journal 112Unranked 1
YearRankTypeTitle / Venue / Authors
2007 J jnl
On the Computational Complexity of the Forcing Chromatic Number.
SIAM J. Comput.
Frank Harary, Wolfgang Slany, Oleg Verbitsky
2006 J jnl
Destroying automorphisms by fixing nodes.
Discret. Math.
David Erwin, Frank Harary
2005 J jnl
Identity orientation of complete bipartite graphs.
Discret. Math.
Frank Harary, Desh Ranjan
2005 A conf
On the Computational Complexity of the Forcing Chromatic Number.
STACS
Frank Harary, Wolfgang Slany, Oleg Verbitsky
2004 J jnl
Algorithms for derivation of structurally stable Hamiltonian signed graphs.
Int. J. Comput. Math.
Frank Harary, Meng-Hiot Lim, Amit Agarwal, Donald C. Wunsch
2004 J jnl
On Computational Complexity of the Forcing Chromatic Number
CoRR
Frank Harary, Wolfgang Slany, Oleg Verbitsky
2004 J jnl
On the lengths of symmetry breaking-preserving games on graphs.
Theor. Comput. Sci.
Frank Harary, Wolfgang Slany, Oleg Verbitsky
2003 J jnl
Edge Sums of Debruijn Interconnection Networks.
Int. J. Comput. Math.
Daniela Ferrero, Frank Harary
2003 J jnl
Preface.
Discret. Math.
Frank Harary
2002 J jnl
A Radio Coloring of a Hypercube.
Int. J. Comput. Math.
Ophir Frieder, Frank Harary, Peng-Jun Wan
2002 J jnl
A constraint logic programming approach for generating all perfect matchings.
Appl. Math. Lett.
Frank Harary, Gopal Gupta
2002 J jnl
On the geodetic number of a graph.
Networks
Gary Chartrand, Frank Harary, Ping Zhang
2002 J jnl
Unsolved Problems on Distance in Graphs.
Electron. Notes Discret. Math.
Fred Buckley, Frank Harary
2001 J jnl
A Symmetric Strategy in Graph Avoidance Games
CoRR
Frank Harary, Wolfgang Slany, Oleg Verbitsky
2001 J jnl
A new graph characteristic and its application to numerical computability.
Inf. Process. Lett.
Frank Harary, Vladik Kreinovich, Luc Longpré
2001 J jnl
Destroying symmetry by orienting edges: Complete graphs and complete bigraphs.
Discuss. Math. Graph Theory
Frank Harary, Michael S. Jacobson
2001 — conf
Early Computer Science Adventures of a Mathematician.
DMTCS
Frank Harary
2001 J jnl
On the Maximum Number of Cyclic Triples in Oriented Graphs.
J. Comb. Theory B
Lowell W. Beineke, Frank Harary
2000 J jnl
An Heuristic Algorithm for Handling Multiple Responses.
J. Heuristics
Maria Satratzemi, Constantine Tsouros, Frank Harary
2000 J jnl
Double Domination in Graphs.
Ars Comb.
Frank Harary, Teresa W. Haynes
2000 J jnl
Geodetic sets in graphs.
Discuss. Math. Graph Theory
Gary Chartrand, Frank Harary, Ping Zhang
2000 J jnl
How large can the domination numbers of a graph be?
Australas. J Comb.
Gary Chartrand, Linda Eroh, Frank Harary, Ping Zhang
2000 J jnl
On the Hall Number of a Graph.
Ars Comb.
Gary Chartrand, Frank Harary, Ping Zhang
2000 J jnl
The Automorphism Group of a Hypercube.
J. Univers. Comput. Sci.
Frank Harary
1999 J jnl
On the out-domination and in-domination numbers of a digraph.
Discret. Math.
Gary Chartrand, Frank Harary, Bill Quan Yue
1998 J jnl
Breaking Symmetry in Complete Graphs by Orienting Edges: Asymptotic Bounds.
Inf. Process. Lett.
Frank Harary, Desh Ranjan
1997 J jnl
On complete systems of invariants for small graphs.
Int. J. Comput. Math.
Frank Harary, Stavros D. Nikolopoulos
1997 J jnl
The color cost of a caterpillar.
Discret. Math.
Mario Gionfriddo, Frank Harary, Zsolt Tuza
1996 J jnl
A Study of Maximum Unit-circle Caterpillars - Tools for the Study of the Shape of Adsorption Patterns.
Discret. Appl. Math.
Frank Harary, William Randolph, Paul G. Mezey
1996 J jnl
Node fault tolerance in graphs.
Networks
Frank Harary, John P. Hayes
1996 J jnl
Nordhaus-Gaddum inequalities for domination in graphs.
Discret. Math.
Frank Harary, Teresa W. Haynes
1995 J jnl
One node fault tolerance for caterpillars and starlike trees.
Int. J. Comput. Math.
Frank Harary, Mohammed Khurrum
1995 J jnl
Size in maximal triangle-free graphs and minimal graphs of diameter 2.
Discret. Math.
Curtiss Barefoot, Karen Casey, David C. Fisher, Kathryn Fraughnaugh, Frank Harary
1994 J jnl
Minimum degree games for graphs.
Discret. Math.
Daniel M. Gordon, Robert W. Robinson, Frank Harary
1994 J jnl
Sum graphs over all the integers.
Discret. Math.
Frank Harary
1994 J jnl
The square of a chordal graph.
Discret. Math.
Frank Harary, Terry A. McKee
1993 J jnl
Edge fault tolerance in graphs.
Networks
Frank Harary, John P. Hayes
1993 J jnl
Realizing the chromatic numbers of triangulations of surfaces.
Discret. Math.
Frank Harary, Serge Lawrencenko, Vladimir P. Korzhik
1993 J jnl
Subcube Fault-Tolerance in Hypercubes
Inf. Comput.
Niall Graham, Frank Harary, Marilynn Livingston, Quentin F. Stout
1993 J jnl
Which graphs are pluperfect?
Australas. J Comb.
Frank Harary, Martin Lewinter
1992 J jnl
Changing and Unchanging the Diameter of a Hypercube.
Discret. Appl. Math.
Niall Graham, Frank Harary
1991 — book
Graph theory.
Frank Harary
1991 J jnl
What is the difference between the domination and independent domination numbers of a cubic graph?
Graphs Comb.
Curtiss Barefoot, Frank Harary, Kathryn Fraughnaugh Jones
1990 — book
Distance in graphs.
Fred Buckley, Frank Harary
1989 J jnl
Classification of interpolation theorems for spanning trees and other families of spanning subgraphs.
J. Graph Theory
Frank Harary, Michael Plantholt
1989 J jnl
The graph of a boolean function.
J. Exp. Theor. Artif. Intell.
Frank Harary
1988 J jnl
Embedding and characterization of quantum chemical reaction graphs on two-dimensional orientable surfaces.
Discret. Appl. Math.
Frank Harary, Paul G. Mezey
1988 J jnl
In memory of Torrence Parsons, 1941-1987.
J. Graph Theory
Frank Harary
1988 J jnl
On graphs with signed inverses.
Networks
Fred Buckley, Lynne L. Doty, Frank Harary
1988 J jnl
On the euclidean dimension of a wheel.
Graphs Comb.
Fred Buckley, Frank Harary
1988 J jnl
The Integral of a Tree.
J. Inf. Sci. Eng.
Frank Harary
1987 J jnl
Hamiltonian threshold graphs.
Discret. Appl. Math.
Frank Harary, Uri N. Peled
1987 J jnl
The class reconstruction number of maximal planar graphs.
Graphs Comb.
Frank Harary, Josef Lauri
1986 J jnl
A Linear Algorithm for the Cutting Center of a Tree.
Inf. Process. Lett.
Frank Harary, Peter J. Slater
1986 J jnl
Editorial: Changing of the guard.
J. Graph Theory
Frank Harary
1986 J jnl
Graph theory as applied mathematics.
J. Graph Theory
Frank Harary
1986 J jnl
Some genuine graph models in anthropology.
J. Graph Theory
Per Hage, Frank Harary
1985 J jnl
Isomorphic factorizations X: Unsolved problems.
J. Graph Theory
Frank Harary, Robert W. Robinson
1985 J jnl
On signed digraphs with all cycles negative.
Discret. Appl. Math.
Frank Harary, J. Richard Lundgren, John S. Maybee
1985 J jnl
On the regulation number of a multigraph.
Graphs Comb.
Gary Chartrand, Frank Harary, Ortrud R. Oellermann
1985 J jnl
The graph reconstruction number.
J. Graph Theory
Frank Harary, Michael Plantholt
1984 J jnl
Digital metrics: A graph-theoretical approach.
Pattern Recognit. Lett.
Frank Harary, Robert A. Melter, Ioan Tomescu
1984 J jnl
Isomorphic factorizations VIII: Bisectable trees.
Comb.
Frank Harary, Robert W. Robinson
1984 J jnl
The rediscovery of Redfield's papers.
J. Graph Theory
Frank Harary, Robert W. Robinson
1983 J jnl
A tribute to Frank P. Ramsey, 1903-1930.
J. Graph Theory
Frank Harary
1983 J jnl
Conditional connectivity.
Networks
Frank Harary
1983 J jnl
Domination alteration sets in graphs.
Discret. Math.
Douglas Bauer, Frank Harary, Juhani Nieminen, Charles L. Suffel
1983 J jnl
In praise of paul erdös on his seventieth.
J. Graph Theory
Frank Harary
1983 J jnl
Regular graphs with given girth pair.
J. Graph Theory
Frank Harary, Peter Kovács
1982 J jnl
Boolean distance for graphs.
Discret. Math.
Frank Harary, Robert A. Melter, Uri N. Peled, Ioan Tomescu
1982 J jnl
Homage to roberto frucht.
J. Graph Theory
Frank Harary
1982 J jnl
On balance in group graphs.
Networks
Frank Harary, Bernt Lindström, Hans-olov Zetterström
1982 J jnl
The smallest 2-connected cubic bipartite planar nonhamiltonian graph.
Discret. Math.
Takao Asano, Nobuji Saito, Geoffrey Exoo, Frank Harary
1981 J jnl
A graph and its complement with specified properties. IV. Counting self-complementary blocks.
J. Graph Theory
Jin Akiyama, Frank Harary
1981 J jnl
Covering and packing in graphs IV: Linear arboricity.
Networks
Jin Akiyama, Geoffrey Exoo, Frank Harary
1981 J jnl
Graphs as models of communication network vulnerability: Connectivity and persistence.
Networks
Frank Boesch, Frank Harary, Jerald A. Kabell
1981 J jnl
Homage to the memory of Kazimierz Kuratowski.
J. Graph Theory
Frank Harary
1981 J jnl
Oriented two-dimensional circuits.
Discret. Math.
A. K. Dewdney, Frank Harary
1981 J jnl
Paley graphs satisfy all first-order adjacency axioms.
J. Graph Theory
Andreas Blass, Geoffrey Exoo, Frank Harary
1981 J jnl
The cohesiveness of a point of a graph.
Networks
Jin Akiyama, Frank Boesch, Hiroshi Era, Frank Harary, Ralph Tindell
1980 J jnl
A simple algorithm to detect balance in signed graphs.
Math. Soc. Sci.
Frank Harary, Jerald A. Kabell
1980 J jnl
Bigraphs versus digraphs via matrices.
J. Graph Theory
Richard A. Brualdi, Frank Harary, Zevi Miller
1980 J jnl
Digraphs with real and gaussian spectra.
Discret. Appl. Math.
Friedrich Esser, Frank Harary
1980 J jnl
Graph Theoretic Models.
Theor. Comput. Sci.
Frank Harary
1980 J jnl
Monotone sequences of graphical invariants.
Networks
Frank Harary, Jerald A. Kabell
1980 J jnl
On the Spectrum of a Complete Multipartite Graph.
Eur. J. Comb.
Friedrich Esser, Frank Harary
1980 J jnl
Some problems in topological graph theory.
J. Graph Theory
Jonathan L. Gross, Frank Harary
1980 J jnl
The smallest graphs with certain adjacency properties.
Discret. Math.
Geoffrey Exoo, Frank Harary
1980 J jnl
Which trees are link graphs?
J. Comb. Theory B
Andreas Blass, Frank Harary, Zevi Miller
1979 J jnl
Generalized ramsey theory for graphs, x: double stars.
Discret. Math.
Jerrold W. Grossman, Frank Harary, Maria M. Klawe
1979 J jnl
On double and multiple interval graphs.
J. Graph Theory
William T. Trotter, Frank Harary
1979 J jnl
Properties of almost all graphs and complexes.
J. Graph Theory
Andreas Blass, Frank Harary
1979 J jnl
The graphs for which all strong orientations are hamiltonian.
J. Graph Theory
Martin Grötschel, Frank Harary
1979 J jnl
The graphs with only self-dual signings.
Discret. Math.
Frank Harary, Helene J. Kommel
1978 J jnl
Generalized ramsey theory for graphs VII: Ramsey numbers for multigraphs and networks.
Networks
Frank Harary, Allen J. Schwenk
1978 J jnl
Unicyclic realizability of a degree list.
Networks
Francis T. Boesch, Frank Harary
1977 J jnl
Editorial.
J. Graph Theory
Frank Harary, Gary Chartrand
1977 J jnl
Enumeration of graphs with signed points and lines.
J. Graph Theory
Frank Harary, Edgar M. Palmer, Robert W. Robinson, Allen J. Schwenk
1977 J jnl
Homage to george pólya.
J. Graph Theory
Frank Harary
1977 J jnl
The biparticity of a graph.
J. Graph Theory
Frank Harary, Derbiau Hsu, Zevi Miller
1977 J jnl
The divisibility theorem for isomorphic factorizations of complete graphs.
J. Graph Theory
Frank Harary, Robert W. Robinson, Nicholas C. Wormald
1976 J jnl
On Tactical Configurations with No Four-Cycles.
J. Comb. Theory A
Frank Harary, Allen J. Schwenk
1975 J jnl
On the cell-growth problem for arbitrary polygons.
Discret. Math.
Frank Harary, Edgar M. Palmer, Ronald C. Read
1974 J jnl
Generalized Ramsey theory for graphs IV, the Ramsey multiplicity of a graph.
Networks
Frank Harary, Geert C. E. Prins
1974 J jnl
On clique-extremal (p, q)-graphs.
Networks
Frank Harary, Abraham Lempel
1973 — book
Graphical enumeration.
Frank Harary, Edgar M. Palmer
1973 J jnl
The number of caterpillars.
Discret. Math.
Frank Harary, Allen J. Schwenk
1972 J jnl
On the automorphism group of a matroid.
Discret. Math.
Frank Harary, M. J. Piff, D. J. A. Welsh
1971 J jnl
The cutting center theorem for trees.
Discret. Math.
Frank Harary, Phillip A. Ostrand
1970 J jnl
A Matrix Approach to Nonstationary Chains.
Oper. Res.
Frank Harary, Benjamin Lipstein, George P. H. Styan
1970 J jnl
A formal system for information retrieval from files.
Commun. ACM
David Hsiao, Frank Harary
1967 J jnl
Enumeration of Finite Automata
Inf. Control.
Frank Harary, Edgar M. Palmer
1967 J jnl
On the computer enumeration of finite topologies.
Commun. ACM
J. W. Evans, Frank Harary, M. Stuart Lynn
1960 J jnl
On the Consistency of Precedence Matrices.
J. ACM
Frank Harary
1959 J jnl
Graph theory and electric networks.
IRE Trans. Inf. Theory
Frank Harary
1958 J jnl
Note on Carnap's Relational Asymptotic Relative Frequencies.
J. Symb. Log.
Frank Harary
1950 J jnl
On Complete Atomic Proper Relation Algebras.
J. Symb. Log.
Frank Harary