Citation: F. Harary et D. Ranjan, BREAKING SYMMETRY IN COMPLETE GRAPHS BY ORIENTING EDGES - ASYMPTOTIC BOUNDS, Information processing letters, 67(5), 1998, pp. 227-230
Citation: N. Graham et F. Harary, SOME SMALL-SIZED SPANNING SUBGRAPHS OF A HYPERCUBE, Computers & mathematics with applications, 34(11), 1997, pp. 51-57
Citation: F. Harary et B. Raghavachari, THE E-MAIL GOSSIP NUMBER AND THE CONNECTED DOMINATION NUMBER, Applied mathematics letters, 10(4), 1997, pp. 15-17
Citation: F. Harary et Pg. Mezey, CELL-SHEDDING TRANSFORMATIONS, EQUIVALENCE-RELATIONS, AND SIMILARITY MEASURES FOR SQUARE-CELL CONFIGURATIONS, International journal of quantum chemistry, 62(4), 1997, pp. 353-361
Citation: F. Harary et Sd. Nikolopoulos, ON COMPLETE SYSTEMS OF INVARIANTS FOR SMALL GRAPHS, International journal of computer mathematics, 64(1-2), 1997, pp. 35-46
Citation: F. Harary et al., A STUDY OF MAXIMUM UNIT-CIRCLE CATERPILLARS - TOOLS FOR THE STUDY OF THE SHAPE OF ADSORPTION PATTERNS, Discrete applied mathematics, 67(1-3), 1996, pp. 127-135
Citation: F. Harary et M. Khurrum, ONE NODE FAULT-TOLERANCE FOR CATERPILLARS AND STARLIKE TREES, International journal of computer mathematics, 56(3-4), 1995, pp. 135-143
Citation: P. Hage et F. Harary, CLOSE-PROXIMITY ANALYSIS - ANOTHER VARIATION ON THE MINIMUM-SPANNING-TREE PROBLEM, Current anthropology, 36(4), 1995, pp. 677-683
Citation: N. Graham et F. Harary, HYPERCUBES, SHUFFLE-EXCHANGE GRAPHS AND DEBRUIJN DIGRAPHS, Mathematical and computer modelling, 17(11), 1993, pp. 69-74