Frank Harary

Publication Activity (10 Years)

Years Active: 1950-2007
Publications (10 Years): 0

Publications

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

Frank Harary.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Frank Harary