24. (with R. Frucht and A. Gewirtz) The least number of edges for connected graphs having automorphism group of order three. (English translation of [23]). Mathematics Department, Pace University, New York, NY. (1971).

27. (with J. Yarmish) The number of chiral alkanes having carbon automorphism group isomorphic to a symmetric group. Proceedings of the 2nd Caribbean Conference on Combinatorics and Computing, University of the West Indies (1977) 160–190.

28. (with D.J. McCarthy) The construction of minimal-line graphs with given automorphism group. Topics in Graph Theory (Papers from the Scientist-in-Residence Program, New York Academy of Sciences, May 1977) Ann. New York Acad. Sci. 328 (1979) 144–156.

29. (with J. Yarmish) The number of chiral alkanes having given diameter and carbon automorphism group a symmetric group. Ann. New York Acad. Sci. 319 (1979) 436–443.

53. A volume function for water based on a random lattice-subgraph model. Chemical Applications of Topology and Graph Theory, Studies in Physical and Theoretical Chemistry28, Elsevier, Amsterdam (1983) 446–453.

54. (with M. Gargano) Smallest order pairs of non-isomorphic graphs having the same distance degree sequence and specified number of cycles. Notes from New York Graph Theory Day VI, May 14, 1983, New York Academy of Sciences (1983) 13–16.

64. (with F. Buckley and F. Harary) Extremal results on the geodetic number of a graph. Scientia Series A: Mathematical Sciences2 (1988) 17–26.

65. (with K.T. Balińska) Generating random f-graphs. The equiprobable limit. Proceedings of the Fifth Caribbean Conference on Combinatorics and Computing, Barbados, West Indies, January 4–8, 1988, University of the West Indies (1988), 127–157.

129. (with K.T. Balińska and M.L. Gargano) The reversible random f-graph process with loops. Proceedings of a Festschrift Held on the Occasion of the Retirement of Professor Robert Bumcroft, Department of Mathematics, Hofstra University (2002) 118-128.

131. (with K.T. Balińska, M.L. Gargano, J. Rubens, M. Lewinter, and J.F. Malerba) The Flavor of Research in Graph Theory. Four Papers at the Leading Edge. CSIS Pace University Technical Report179 (2002). Includes reprints of [123][124] and [127].

154. (with K.T. Balińska and K.T. Zwierzyński) On generating graphs with bounded degree and a given chromatic number. Studies in Automation and Information Technology 32, Publishing House of the Poznań Society for the Advancement of the Arts and Sciences, Poznań, (2007) 7-16.

176. (with E.G. DuCasse and L. Brancati) A graph whose vertices are all the divisors of a positive integer: Fundamentals. Bulletin of the Institute of Combinatorics and its Applications 73 (2015) 47-62.