1. (with F.Supnick) On the functional equation *f*(*ax*) = *af*(*x*). *Notices Amer. Math.Soc.* **8 **Abstract 577-8 (1961) 51.

2. (with F. Supnick) Semi-homogeneous functions. *Proc. Amer. Math. Soc*. **14** (1963) 620–625.

3. A note on semi-homogeneous functions. *Notices Amer. Math. Soc*. **12** Abstract 64T-289 (1964) 452.

4. One-dimensional cell complexes with homeotopy group equal to zero. *Canad. J. Math.* **16** (1964) 353–357.

5. (with F.Supnick) Extreme Hamiltonian circuits. Resolution of the convex odd case. *Proc. Amer. Math. Soc*. **15** (1964) 454–456.

6. The extrema of a certain type of connectivity for graphs. *Amer. Math. Monthly* **72** (1965) 155–156.

7. (with F. Supnick) Extreme Hamiltonian circuits. Resolution of the convex-even case. *Proc. Amer. Math. Soc*. **16** (1965) 1058–1061.

8. (with F. Supnick) On some properties of shortest Hamiltonian circuits. *Amer. Math. Monthly* **72** (1965) 977–980.

9. The homotopy groups of the space of homeomorphisms of a multiply punctured surface. *Illinois** J. Math*. **9** (1965) 721–725.

10. (with F. Supnick) Extrema concerning polygons in space-time. *Bull. Amer. Math. Soc*. **72** (1966) 71–74.

11. (with F. Supnick) Extrema in space-time. *Canad. J. Math*. **18** (1966) 678–691.

12. Extrema concerning asymmetric graphs. *J. Combinatorial Theory* **3 **(1967) 57–82.

13. The least number of edges for graphs having symmetric automorphism group. *J. Combinatorial Theory* **5** (1968) 115–125.

14. (with M. Richardson) Orbit complexes of graphs. *J. Combinatorial Theory* **5** (1968) 323–343.

15. Solved and unsolved problems in the computation of homeotopy groups of 2-manifolds. *Trans. N. Y. Acad. Sci*. **30 **Ser. II (1968) 919–938.

16. (with A. Gewirtz) Connected extremal edge graphs having symmetric automorphism group. *Recent Progress in Combinatorics*. Academic Press, New York (1969) 223–227.

17. (with A. Gewirtz and A. Hill) El número mínimo de puntos para grafos regulares y asimetricos. *Scientia* **138** (1969) 103–111.

18. (with A. Gewirtz and A. Hill) Extremum problems concerning graphs and their groups. *Combinatorial Structures and Their Applications*. Gordon and Breach, New York (1970) 103–109.

19. (with A. Gewirtz) A call for interdisciplinary relationships. *International Conference on Combinatorial Mathematics* (New York, NY, April 1970) *Ann. New York Acad. Sci.* **175** (1970) 5–6.

20. (with A. Gewirtz) The uniqueness of a certain graph. *J. Combinatorial Theory ***11** (1971) 45–53.

21. (with R. Frucht and A. Gewirtz) The least number of edges for graphs having automorphism group of order three. *Recent Trends in Graph Theory*. Springer-Verlag, New York (1971) 95–104.

22. (with A. Gewirtz) Fixed points of antitone mappings. *Recent Trends in Graph Theory*. Springer-Verlag, New York (1971) 117–136.

23. (with R. Frucht and A. Gewirtz) El número mínimo de lineas para grafos conexos con grupo de automorfismos de orden 3. *Scientia* **142** (Valparaíso) (1971) 72–85.

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).

25. (with R. Frucht and A. Gewirtz) Extremal edge graphs having given automorphism group. *Proceedings of the Third Southeastern Conference on Combinatorics, Graph Theory and Computing* (Florida Atlantic University, Boca Raton, Fla., March 1972) (1972) 213–219.

26. (with D.J. McCarthy) A stability theorem for minimum edge graphs with given abstract automorphism group. *Trans. Amer. Math. Soc*. **208** (1975) 27–39.

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.

30. (with A. Gewirtz) Remarks on this conference and its proceedings. *Second International Conference on Combinatorial Mathematics *(New York, NY, April 1978). *Ann. N.Y. Acad. Sci.* **319** (1979), ix–x (preface).

31. (with P. Hell) An intermediate value theorem for graphs with given automorphism group. *J. Graph Theory* **3** (1979) 35–41.

32. (with P. Hell) Partial joins and graphs with given group, order, and size. *Congressus Numerantium* **XXI** (1978) 357–371.

33. (with M. Stehlik and J. Yarmish) Degree partition classes for 4-trees having specified properties. *Congressus Numerantium* **XXIV** (1979) 795–821.

34. (with W.J. Martino and J. Yarmish) Degree partition matrices for rooted and unrooted 4-trees. Mathematics Department, Pace University, New York, NY (1980).

35. (with J. Yarmish) Valence isomers for chemical trees. *Match* **12** (1981) 65–73.

36. (with G.S. Bloom and J.W. Kennedy) Distance degree regular graphs. *The Theory and Applications of Graphs*. John Wiley & Sons, New York (1981) 95–108.

37. (with M.D. Schiano and J. Yarmish) Degree partition matrices for identity 4-trees. Mathematics Department, Pace University, New York, NY (1980).

38. (with P.J. Slater) Pairs of non-isomorphic graphs having the same path degree sequence. *Match* **12** (1981) 75–86.

39. (with G.S. Bloom and J.W. Kennedy) Improved bounds for packing the surface of an *n*-sphere. Tech . Rep. CCNY-CS 479, Computer Science Department, City College, CUNY, New York (1980).

40. (with G.S. Bloom and J.W. Kennedy) Improved bounds for packing an *n*-sphere with uniform *n*-spheres. Tech. Rep. CCNY-CS **579**, Computer Science Department, City College, CUNY, New York (1980).

41. (with J.W. Kennedy) Extremal *f*-trees and embedding spaces for molecular graphs. *Discrete Applied Math*. **5** (1983) 191–209.

42. (with P. Brown, M.D. Schiano, and J. Yarmish) Distributions of small order 4-trees and some implications for large orders. Mathematics Department, Pace University, New York, NY (1981).

43. (with F.Y. Halberstam) Distance and path degree sequences for cubic graphs. Mathematics Department, Pace University, New York, NY (1982).

44. (with G.S. Bloom and J.W. Kennedy) Research Note: A characterization of graphs of diameter two. Research Institute, Advanced Medical Products, Essex, England (1982); see [59].

45. (with J. Yarmish) Degree distributions for random 4-trees and skeletons of symmetry weighted (1,4)-trees. *Congressus Numerantium* **36** (1982) 115–125.

46. with C.W. Haigh and J.W. Kennedy) Counting and coding identity trees with fixed diameter and bounded degree. *Discrete Applied Math*. **7** (1984) 141–160.

47. (with F.Y. Halberstam) A note on tables of distance and path degree sequences for cubic graphs. Mathematics Department, Pace University, New York, NY (1982). Presented at Silver Jubilee Conference on Combinatorics, University of Waterloo , June 14-July 2, 1982.

48. (with A.T. Balaban) The smallest graphs, trees, and 4-trees with degenerate topological index J. *Match* **14** (1983) 213–233.

49. (with G.S. Bloom and J.W. Kennedy) On crossing numbers and linguistic structures. *Graph Theory, Lagów 1981, Lecture Notes in Mathematics* **1018**, Springer-Verlag, Berlin (1983) 14-22.

50. (with G.S. Bloom, J.W. Kennedy, and M.T. Mandziuk) Random graphs and the physical world. *Graph Theory, Lagów 1981, Lecture Notes in Mathematics* **1018**, Springer-Verlag, Berlin (1983) 94–110.

51. (with G.S. Bloom and J.W. Kennedy) Some problems concerning distance and path degree sequences. *Graph Theory, Lagów 1981, Lecture Notes in Mathematics* **1018**, Springer-Verlag, Berlin (1983) 179–190.

52. Random subgraphs of regular graphs. *Graph Theory, Singapore 1983, Lecture Notes in Mathematics* **1073**, Springer-Verlag, Tokyo (1984) 150–160.

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 Chemistry* **28**, 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.

55. (with Z. Palka) Random subgraphs of the *n*-cycle. *Discrete Math*. **52** (1984) 243–251.

56. (with P. Martinez) Distance degree injective regular graphs. *Notes from New York Graph Theory Day* **VIII**, May 12, 1984, New York Academy of Sciences (1984) 19–21.

57. (with J.W. Kennedy and M.M.Syslo) The theorem on planar graphs. *Historia Mathematica* **12** (1985) 356–368.

58. (with M. Gargano) A digraph generalization of balanced signed graphs. *Congressus Numerantium* **48** (1985) 133–144.

59. (with G.S. Bloom and J.W. Kennedy) A characterization of graphs of diameter two. *Amer. Math. Monthly* **95** (1988) 37–38; see [44].

60. (with K.T. Balińska) On generating random *f*-graphs. *Notes from New York Graph Theory Day* **XII** (October 11, 1986, SUNY at Albany, N.Y.) New York Academy of Sciences (1986) 22–24.

61. (with J.W. Kennedy) Probability models for random *f*-graphs. *Combinatorial Mathematics* (New York, June 10–14, 1985) Ann. New York Acad. Sci. **555** (1989) 248–261.

62. (with A.T. Balaban and J.W. Kennedy) The number of alkanes having *n* carbons and a longest chain of length *d*: An application of a theorem of Pólya. *J. Chemical Education* **65** (1988) 304–313.

63. (with K.T. Balińska) Random graph models for physical systems. *Graph Theory and Topology in Chemistry, Studies in Physical and Theoretical Chemistry* **51**, Elsevier, Amsterdam (1987) 349–361.

64. (with F. Buckley and F. Harary) Extremal results on the geodetic number of a graph. *Scientia* Series A: *Mathematical Sciences* **2** (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.

66. (with J.W. Kennedy) Introductory remarks. Special Volume on Applications of Graphs in Chemistry and Physics. *Discrete Applied Math*. **19** (1988) 1–3.

67. (with R. Gross, J.W. Kennedy, and M.L. Yarmush) Antigenesis: A cascade-theoretical analysis of the size distributions of antigen-antibody complexes. *Discrete Applied Math.* **19** (1988) 177–194.

68. (with M. Borowiecki) Magic digraphs. *Internationales wissenschaftliches Kolloquium ***33**, Technische Hochschule Ilmenau, DDR (1988) 163-166.

69. (with K.T. Balińska) The sequential generation of random *f*-graphs. Preliminaries, an algorithm, and line maximal 2-, 3-, and 4-graphs. Mathematics Department, Pace University, New York, NY, October 7, 1988.

70. (with J.W. Kennedy and P.N. Nikolakos) Extremal graphic sequences. *Recent Studies in Graph Theory*, Vishwa International Publications, Gulbarga, India (1989) 159–176.

71. (with J.W. Kennedy) Highly irregular graphs with given automorphism group. *Scientia* Series A: *Mathematical Sciences* **3** (1989) 33–43.

72. (with K.T. Balińska) A conjecture concerning random sequentially generated line maximal *f*-graphs. *Graph Theory Notes of New York* **XVII**, New York Academy of Sciences (1989) 20–22.

73. (with K.T. Balińska) The sequential generation of random *f*-graphs. Line maximal 2-, 3-, 4-graphs. *Computers & Chemistry* **14** (1990) 323–328.

74. (with M. Gargano and J.W. Kennedy) Irregular digraphs. *Congressus Numerantium ***72** (1990) 223–233.

75. (with K.T. Balińska) The sequential generation of random *f*-graphs. Distributions of edge-maximal *f*-graphs as functions of *f*. Computer Science Center, *The Technical University of Poznań, Report* **316** May 15, 1989; Revised May 18, 1990.

76. (with Z.S. Chen and J.W. Kennedy) The long and short of cascade trees: Height and a duality in cascade processes. *Mathematical Vistas, Ann. New York. Acad. Sci.* **607** (1990) 14–38.

77.(with I. Gutman and J.W. Kennedy) Wiener numbers of random benzenoid chains. *Chemical Physics Letters* **173** (1990) 403–408.

78. (with I. Gutman and J.W. Kennedy) Perfect matchings in random hexagonal chains. *J. Mathematical Chemistry* **6** (1991) 377–385.

79. (with K.T. Balińska) The algorithm IMAGE for the random 2-graph process. *Computer** Science Center, The Technical University of Poznań, Report* **334**, September 8, 1990.

80. (with K.T. Balińska) The sequential generation of random edge maximal *f*-graphs as a function of *f*. *J. Mathematical Chemistry* **8** (1991) 39–51.

81. (with K.T. Balińska) Problem: Random Graphs ‘89: *Open Problems. Random Graphs* **2**, John Wiley & Sons (1992) 279.

82. (with K.T. Balińska) Edge maximal graphs with large bounded degree. *Advances in Graph Theory*, Vishwa International Publications, Gulbarga, India (1991) 11–18.

83. (with K.T. Balińska) The random *f*-graph process. *Quo Vadis, Graph Theory?, Annals of Discrete Math.* **55** (1993) 333–340.

84. (with S.C. Friederich and M.L. Gargano) Matroid bases with optimal sequencing. *Congressus Numerantium* **82** (1991) 65–77.

85. (with M.L. Gargano, J.W. Kennedy and D.J. McCarthy) Locks, keys, and threshold schemes: A study in mathematical pragmatism. *Graph Theory Notes of New York* **XXII**, New York Academy of Sciences (1992) 38–41.

86. (with E.J. Farrell, J.W. Kennedy, and S.A.Wahid) Graphs with palindromic matching and characteristic polynomials. *Vishwa International J. Graph Theory ***1** (1992) 61–78.

87. (with K.T. Balińska and H. Galina) A kinetic approach to the random *f*-graph process. *Graph Theory Notes of New York ***XXIII**, New York Academy of Sciences (1992) 35–40.

88. (with J. Szymański) Nonuniform random recursive trees with bounded degree. *Sets, Graphs, and Numbers. Coll. Math. Soc. J. Bolyai* **60** (1991) 611–620.

89. (with K.T. Balińska) The sequential generation of random *f*-graphs. Distributions and predominant types of edge maximal f-graphs with f > 4. (Combinatorics and Algorithms, Jerusalem 1988) *Discrete Math.* **114** (1993) 19–22.

90. (With K.T. Balińska) Problem 165: On the random *f*-graph process. (4th Int. Symp. on Graphs and Combinatorics, Marseille 1990) *Discrete Math.* **111** (1993) 488.

91. (With K.T. Balińska) On generating random *f*-graphs. *Graph Theory Notes of New York* **XXV**, New York Academy of Sciences (1993) 46–47.

92. (with K.T. Balińska and E.A.J. Godehardt) When is the random *f*-graph process the random graph process. *Scientia* Series A: *Mathematical Sciences* **4** (1990/1991) 15–19.

93. (with K.T. Balińska and E.A.J Godehardt) Relations between the random *f*-graph process and the random graph process. *Graph Theory Notes of New York*** XXVI**, New York Academy of Sciences (1994) 42–45.

94. (with K.T. Balińska) Big cycles in random edge maximal 2-graphs. *Congressus Numerantium* **93** (1993) 131–141.

95. (with M.L. Gargano and D.L. von Kleek) Using genetic algorithms to solve mathematically difficult pollution problems. *Congressus Numerantium* **88** (1992) 39–44.

96. (with G.O.H. Katona) The largest component in a random subgraph of the *n*-cycle. (Niedzica 1990) *Discrete Math.* **121** (1993) 113–116.

97. (with K.T. Balińska and J. Szymański) Random recursive forests. *Random Structures & Algorithms* **5** (1994) 3–12.

98. (with K.T. Balińska) The algorithm IMAGE *f* for the Random *f*-Graph Process. *Computer Science Center, The Technical University of Poznan, Report* **362** (1992) (updated 1993).

99. (with K.T. Balińska) The algorithm imPBC for the Random 2-Graph Process. *Computer* Science* Center, The Technical University of Poznań, Report* **411** (1993).

100. (with K.T. Balińska) Some problems on one edge transformed graphs. *Graph Theory Notes of New York* **XXIX**, New York Academy of Sciences (1995) 38–39.

101. (with K.T. Balińska, F. Buckley and M.L. Gargano) The diameter of a graph whose vertices are graphs. *CSIS** Pace University** Technical Report Series, Report* **89** (1995).

102. (with K.T. Balińska) Properties of the transition digraph for the random 2-graph process. *Caribb. J. Math. Comput. Sci.* **5** (1995) 54–69.

103. (with K.T. Balińska) A diameter problem and some midsize graph problems. *1995 Prague Midsummer Combinatorial Workshop* (edited by Martin Klazar) *KAM Series* **95-309**, Department of Applied Mathematics, Charles University, Prague (1995) 6–10.

104. (with K.T. Balińska) Degrees in a digraph whose nodes are graphs. (Selected papers in honor of Paul Erdős on the occasion of his 80th birthday) *Discrete Math.*** 150** (1996) 17–29.

105. (with K.T. Balińska, H. Galina and J. Szymański) A kinetic approach to the random *f*-graph process with nonuniform edge probabilities. *J. Chem. Inf. Comput. Sci.* **36** (1996) 347–350.

106. (with K.T. Balińska) Isomorphism classes of one edge transformed graphs. (Stará Lesna, 1994) *Tatra Mountains** Math. Publ*. **9** (1996) 57–67.

107. (with K.T. Balińska, H. Galina and J. Szymański) A kinetic approach to the random *f*-graph process. Paths, cycles and components. (Chemical Applications of Mathematics) *Discrete Applied Math*. **67 **(1996) 13–25.

108. (with M.L. Gargano and F. LoSacco) The capacitated minimal spanning tree problem: A genetic algorithmic approach. Extended Abstract: *Proceedings Northeast Business and Economic Association 1996, *Annual Conference (edited by Ron DiBattista) Dowling College, New York, (1996) 154–155.

109. (with K.T. Balińska) Identity trees and forests. *Computer Science Center, The Technical University of Poznań, Report* **412** (1994) (revised March 1996).

110. (with K.T. Balińska) Two problems on self-complementary graphs. *1996 Prague Midsummer Combinatorial Workshop *(edited by Martin Klazar) *KAM Series* **97-339**, Department of Applied Mathematics, Charles University, Prague (1997), 8–14.

111. (with K.T. Balińska and G.R. Brightwell) Graphs whose vertices are graphs with bounded degree: Distance problems. *Centre for Discrete and Applicable Mathematics, London School of Economics & Political Science, Research Report*, *LSE-CDAM-***97-05** (March 1997).

112. (with K.T. Balińska) Distance problems and a random graph model. *Fifth Prague Midsummer Combinatorial Workshop* (edited by Jiri Fiala) *KAM-DIMATIA-Series ***98-386**, Department of Applied Mathematics and DIMATIA, Charles University, Prague (1998) 7-10.

113. (with E.J. Farrell and J.W. Kennedy) Graph permanent, determinant and cycle polynomials. *Bulletin of the Institute of Combinatorics and its Applications* **23** (1998) 73-82.

114. (with K.T. Balińska) The Reversible Random *f*-Graph Process. *CSIS** Pace University** Technical Report ***132** (1998).

115. (with K.T. Balińska and G.R. Brightwell) Graphs whose vertices are graphs with bounded degree: Distance problems. *J. Mathematical Chemistry* **24** (1998) 109-121.

116. (with E.J. Farrell and J.W. Kennedy) Permanents, determinants, and cycle polynomials, *Graph Theory Notes of New York* **XXXVI**, New York Academy of Sciences (1999) 30-34.

117. (with M.L. Gargano and J.W. Kennedy) Group weighted balanced digraphs and their duals. *Congressus Numerantium* **131** (1998) 161-167.

118. (with K.T. Balińska) Maximum outdegrees in a digraph whose nodes are graphs with bounded degree. *Paul Erdős and His Mathematics, Research communications of the conference held in the memory of Paul Erdős*, Budapest, Hungary July 4-11, 1999, A. Sali, M. Simonovits, V.T. Sós (Editors), *János Bolyai Mathematical Society*, Budapest, Hungary (1999) 23-26.

119. (with E.J. Farrell and J.W. Kennedy) Permanents and Determinants of graphs: A cycle polynomial approach. *J. Combinatorial Mathematics and Combinatorial Computing* **32** (2000) 129-137.

120. (with J. Szymański) Graphs whose vertices are forests with bounded degree: Distance problems. *Bulletin of the Institute of Combinatorics and its Applications* **28** (2000) 25-35.

121. (with E.J. Farrell and J.W. Kennedy) Permanents of matrices: A cycle polynomial approach. *Bulletin of the Institute of Combinatorics and its Applications* **28** (2000) 99-106.

122. (with K.T. Balińska) Results and problems concerning edge transformed graphs. *6-th International Conference on Graph Theory, Luminy 2000* (Editor, Irena Rusu) *Electronic Journal of Discrete Mathematics* **5** (2000) 9-12.

123. (with M.L. Gargano and J. Rubens) Complement domination. *Congressus Numerantium* **145** (2000) 109-120.

124. (with K.T. Balińska and M.L. Gargano) Two models for graphs with bounded degree. *Croatica Chemica Acta* **74** (2001) 207-223.

125. (with M.L. Gargano and J.W. Kennedy) Recurrence relations and sums of powers of integer sequences. *CSIS** Pace University** Technical Report* **163** (2001).

126. (with K.T. Balińska) Algorithms for the random *f*-Graph Process. *MATCH* **44** (2001) 319-333.

127. (with K.T. Balińska and M.L. Gargano) An edge partition problem concerning Hamilton paths. *Congressus Numerantium* **152** (2001) 45-54.

128. (with J. Szymański) Digraphs whose nodes are multigraphs having exactly two degrees *f *and 2. *Ars Combinatoria* **64** (2002) 117-127.

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.

130. (with K.T. Balińska and K.T. Zwierzyński) Extremal size problems for graphs with bounded degree. *Computer** Science Center, The Technical University of Poznań, Report* **484** (2002).

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 Report* **179** (2002). Includes reprints of [123][124] and [127].

132. (with Eric M. Wahl) Random Graph Process Models for Angiogenesis. *CSIS** Pace University** Technical Report* **183** (2002).

133. (with K.T. Balińska, M.L. Gargano, and K.T. Zwierzyński) Graphs with non-traceable edges. *Computer** Science Center, The Technical University of Poznań, Report* **485** (2002).

134. (E.J. Farrell and M.L. Gargano) An edge partition problem concerning perfect matchings. *Congressus Numerantium* **157** (2002) 33-40. Also appears in *CSIS Pace University Technical Report ***199** (2004).

135. (with M.L. Gargano) A simple theorem on self-complementary graphs. *The New York State Teachers’ Journal * **53** (2003) 36.

136. (with E.J. Farrell and M.L. Gargano) Spanning trees in linear polygonal chains. *Bulletin of the Institute of Combinatorics and its Applications* **39** (2003) 67-74. Also appears in *CSIS Pace University Technical Report* **199** (2004).

137. (with E.J. Farrell and M.L. Gargano) An application of path polynomials to discrete random allocation problems. *Utilitas Mathematica* **65** (2004) 181-192.

138. (with E.J. Farrell and M.L. Gargano) An application of star polynomials to discrete random allocation problems. *Utilitas Mathematica* **67** (2005) 81-96.

139. (with E.J. Farrell and M.L. Gargano) A note on the number of spanning trees in long linear polygonal chains. *Bulletin of the Institute of Combinatorics and its Applications* **42** (2004) 106-110.

140. (with K.T. Balińska, M.L. Gargano, and K.T. Zwierzyński) Extremal size problems for graphs with non-traceable edges. *Congressus Numerantium* **162** (2003) 55-64.

141. (with M.L. Gargano) Complementary arithmetic sequences. *Congressus Numerantium ***162** (2003) 33-42.

142. (with M.L. Gargano, L.L. Lurie, and E.M. Wahl) A graph theory analysis of renal glomerular microvascular networks. *Microvascular Research* **67** (2004) 223-230.

143. (with M.L. Gargano and E.M. Wahl) Angiogenesis as a random graph process. *Congressus Numerantium* **167** (2004) 193-207.

144. (with S-H. Cha, M.L. Gargano, and E.M. Wahl) A vascular network growth estimation algorithm using random graphs. *Lecture Notes in Computer Science* **3434**, Springer-Verlag, Berlin (2005) 45-53.

145. (with E.J. Farrell and M.L. Gargano) Constructions of connected graphs with given matchable ratio. *Bulletin of the Institute of Combinatorics and its Applications* **45** (2005) 51-62.

146. (with M.L. Gargano, L.L. Lurie, and E.M. Wahl) Variations on the ballot problem. *Congressus Numerantium* **176** (2005) 33-41.

147. (with K.T. Balińska, M.L. Gargano, and K.T. Zwierzyński) Hamilton paths in graphs whose vertices are graphs. *J. Comb. Math. & Comb. Compt*. **56** (2006) 3-16.

148. (with K.T. Balińska and K.T. Zwierzyński) Extremal size for graphs with bounded degree. *Ars Combinatoria* **81** (2006).235-246.

149. (with M.L. Gargano and G.A. Vaughn Sr.) Improving a greedy DNA motif search using a multiple genomic self-adapting genetic algorithm. *Congressus Numerantium* **185** (2007) 23-29.

150. (with M.L. Gargano) Feasible task schedules with minimum project cost solved by a genetic algorithm. *Communications of the IIMA* **6** (2006) 57-62. Also appears as *CSIS Pace University Technical Report* **237** (2007).

151. (with D. Gagliardi and M.L. Gargano) Neighborhood regular graphs. *Congressus Numerantium* **185** (2007) 31-45..

152. (with M.L. Gargano and L.L. Lurie) Experimentation and discovery in graph theory using an evolutionary tool. *Congressus Numerantium* **185** (2007) 47-55.

153. (with K.T. Balińska and K.T. Zwierzyński) The chromatic number of edge maximal graphs with bounded degree. *Computer** Science Center, The Technical University of Poznań, Report* **545** (2007).

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.

155. (with E.J. Farrell and M.L. Gargano)Bipartite-Assembly.*Utilitas Mathematica ***75** (2008) 3-12.

156. (with E.J. Farrell and M.L. Gargano) Applications of star polynomials to a class of partition problems. *Bulletin of the Institute of Combinatorics and its Applications* **53** (2008) 23-30.

157. (with S-H. Cha, M.L. Gargano, S.Chang, and E.M. Wahl) Estimating a vascular network growth using random graphs. *Machine Graphics & Vision* **17 **(2008) 91-103.

158. (with A. Delgado, M.L. Gargano, and M. Lewinter) Spanning-tree-center vertices of a graph. *Congressus Numerantium* **189 **(2008) 43-48.

159. (with E.G. DuCasse, M.L. Gargano, M.B. Kattimani) The edge degree weight sum of a graph. *Graph Theory Notes of New York* **LVI**, The Mathematical Association of America (2009) 38–43.

160. (with A. Delgado and M. Lewinter) *k*-long graphs. *Congressus Numerantium* **196** (2009) 95-106.

161. (with A. Delgado and M. Lewinter) Color sets of tripartite graphs. *Congressus Numerantium* **199** (2009) 39-44.

162. (with M.L. Gargano and E.G. DuCasse) Value sets of graphs edge-weighted with elements of a finite Abelian group.*Discussiones Mathematicae Graph Theory* **30 **(2010) 5-15.Also appeared as report Mathematics Department, Pace University, New York, No. **1 **(2009).

163. (with K.T. Balińska and K.T. Zwierzyński) The maximum number of one-edge extensions for graphs with bounded degree. *Ars Combinatoria ***115** (2014)* 101-114 *submitted March 18, 2009-accepted January 2010-in print July 2014. Also appeared as Research Report Mathematics Department, Pace University, New York, No. **4 **(2010).

164. (with E.G. DuCasse, A. DePhillips, and A. Michel) Graphs whose vertices are forests with bounded degree: Order and Size. *Congressus Numerantium ***201 **(2010) 65-74.

165. (with A. Delgado and M. Lewinter) Equipartition sets of hypercubes II. *Bulletin of the Institute of Combinatorics and its Applications ***63 **(2011) 51-59.

166. (with E.G. DuCasse) A graph model related to chemistry. *International J. Chemical Modeling ***3 No. 4 **(2011)449-454.Also appears in book: *Advances in Chemical Modeling* **Vol. 3**, *Nova Science Publications, Inc. *(2012).

167. (with E.G. DuCasse) Edge degree weight generalizations. *Graph Theory Notes of New York* **LXI**, Mathematical Association of America (2011) 25-30.

168. (with E.G. DuCasse and M.O. Zimmler) Graphs whose vertices forests with bounded degree: Traceability. *Bulletin of the Institute of Combinatorics and its Applications ***66 **(2012) 65-71.

169. (with K.T. Balińska, K.T. Zwierzyński, and E.G. DuCasse) Domination in graphs whose vertices are forests with bounded degree. Computer Science Center Report No. **634**, The Technical University of Poznań (2012) 1-17.

170. (with E.G. DuCasse) Comments on a graph model related to chemistry. *International J. Chemical Modeling ***4 No. 2/3 **(2012) 143-150. Also appeared in book pp. 239-246 published by Nova Science Publications, Inc. (2013).

171. (with E.G. DuCasse and L. Brancati) A graph whose vertices are all the divisors of a positive integer: Fundamentals. Mathematics Department, Pace University, New York, **No. 2** (2014).

172. (with K.T. Balińska, K.T. Zwierzyński, and E.G. DuCasse) Domination in graphs whose vertices are forests with bounded degree. Mathematics Department, Pace University, New York, **No. 3** (2014).

173. (with K.T. Balińska, K.T. Zwierzyński, and E.G. DuCasse) Domination in graphs whose vertices are forests with bounded degree. *Graph Theory Notes of New York* **LXVII**, The Mathematical Association of America (2014) 24-33.

174. (with S-H. Cha and E.G. DuCasse) Graph invariants based on the divides relation and ordered by prime signatures. *arXiv*: 1405.5283v1 [math.NT] May 21, 2014.

175. (with S-H. Cha, E.G. DuCasse, and J.P. Shor) Graphs whose vertices are forests with bounded degree: Planarity, Order, Size, Traceability, and Diameter. Mathematics Department, Pace University, New York, **No. 4** (2014).

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.

177. (with S-H. Cha, E.G. DuCasse, and J.P. Shor) Graphs whose vertices are forests with bounded degree: Planarity. *Bulletin of the Institute of Combinatorics and its Applications. ***75 **(2015) 107-117.

178. (with S-H. Cha, E.G. DuCasse, K. Kravette, and D.M. Mendoza) A graph model related to chemistry: Conversion of methane to higher alkanes. *International J. Chemical Modeling ***7 No. 1 **(2015) 17-29.

179. (with S-H. Cha, E.G. DuCasse, K. Kravette, and J.P. Shor) Graphs whose vertices are forests with bounded degree: Open Problems. *International Journal Graph Theory and Its Applications. ***1(2) **(2015) 123-129.

180. (with S-H. Cha, E.G. DuCasse, K. Kravette, and D.M. Mendoza) Graph theory and the conversion of methane to higher order alkanes. *Congressus Numerantium. ***224 **(2015) 75-90.

181. (with E.G. DuCasse) Graphs with bounded degree *f-* degree. *The Explicative Dictionary of Nanochemistry. *Nova Science Publications. In Press.

182. (with E.G. DuCasse) Alkanes. *The Explicative Dictionary of Nanochemistry. *Nova Science Publications. In Press.

183. (with E.G. DuCasse) Mathematical Chemistry. *The Explicative Dictionary of Nanochemistry. *Nova Science Publications. In Press.

184. (with E.G. DuCasse) Research educational opportunities at Pace University, Mathematics Department, Pace University, New York, **No. 1** (2016), (2017).

185. (with E.G. DuCasse and K.T. Zwierzyński) Random one-edge transformations of graphs, Mathematics Department, Pace University, New York, **No. 2** (2016).

186. (with E.G. DuCasse and J.M. Zorluoglu) The At Most Unicyclic Random Graph Process, Mathematics Department, Pace University, New York, **No. 1** (2017).

187. (with E.G. DuCasse and J.M. Zorluoglu) Sequence A291648 in *The On-Line* *Encyclopedia of Integer Sequences *(founded in 1964 by N.J.A. Sloane) http://oeis.org (2017).