Edward Farell is a Professor Emeritus from The University of The West Indies (St. Augustine, Trinidad & Tobago Campus) in The Department of Mathematics and Statistics. He specializes in discrete mathematics as well as graph theory, graph polynomials and combinatorial algorithms.

RESEARCH

. Beezer, Robert A.; **Farrell, E. J.** __The matching polynomial of a distance-regular graph__. Int. J. Math. Math. Sci. **23** (2000), no. 2, 89--97.

. **Farrell, E. J.** __Matchings in pentagonal cacti__. J. Math. Sci. (Calcutta) **11** (2000), no. 2, 109--126.

. **Farrell, E. J.**; de Matas, C. M. __Star polynomials of some families of graphs with small cyclomatic numbers__. Util. Math. **58** (2000), 87--96.

. **Farrell, E. J.** __Matchings in triangular cacti__. J. Math. Sci. (Calcutta) **11** (2000), no. 1, 85--98.

. **Farrell, E. J.** __Decomposition of complete graphs and complete bipartite graphs into complete bipartite factors__. J. Math. Sci. (Calcutta) **11** (2000), no. 1, 29--33.

. **Farrell, Edward J.**; Rosenfeld, Vladimir R. __Block and articulation node polynomials of the generalized rooted product of graphs__. J. Math. Sci. (Calcutta) **11** (2000), no. 1, 35--47.

. **Farrell, E. J.**; Wahid, S. A. __$D$-graphs. IV. Constructions of $D$-graphs for linear cacti__. Bull. Inst. Combin. Appl. **30** (2000), 25--42.

. **Farrell, E. J.** __On the derivative of the chromatic polynomial__. Bull. Inst. Combin. Appl. **29** (2000), 33--38.

. **Farrell, Edward J.**; Kennedy, John W.; Quintas, Louis V. __Permanents and determinants of graphs: a cycle polynomial approach__. J. Combin. Math. Combin. Comput. **32** (2000), 129--137.

. **Farrell, E. J.**; de Matas, C. M. __Algorithms for star polynomials of graphs__. J. Math. Sci. (Calcutta) **10** (1999), no. 2, 69--76.

. **Farrell, Edward J**.; Kennedy, John W.; Quintas, Louis V. __Permanents of matrices: a graph cycle polynomial approach__. Bull. Inst. Combin. Appl. **28** (2000), 99--106.

. **Farrell, E. J.**; Wahid, S. A. $D$-graphs. II. __Constructions of $D$-graphs for some families of graphs with even cycles__. Util. Math. **56** (1999), 167--176.

. **Farrell, Edward J.**; Kennedy, John W.; Quintas, Louis V. __Permanents, determinants, and cycle polynomials__. New York Graph Theory Day, 36 (Staten Island, NY, 1998). Graph Theory Notes N. Y. **36** (1999), 30--34.

. **Farrell, Edward J.** __An introduction to clique polynomials__. New York Graph Theory Day, **35** (1998). Graph Theory Notes N. Y. **35** (1998), 13--15.

. **Farrell, E. J.** __Matchings in rectangular cacti__. J. Math. Sci. (Calcutta) **9** (1998), no. 2, 163--183.

. **Farrell, E. J.** __A note on the clique polynomial and its relation to other graph polynomials__. J. Math. Sci. (Calcutta) **8** (1997), no. 2, 97--102.

. **Farrell, Edward J.** __On circuit polynomials and determinants of matrices__. Dedicated to the memory of Paul Erdös (Riverdale, NY, 1996). Graph Theory Notes N. Y. 32 (1997), 47--52.

. **Farrell, E. J**.; Ramsamooj, N. __On the derivatives of a certain characteristic polynomial__. J. Math. Sci. (Calcutta) **9** (1998), no. 1, 93--99.

. **Farrell, Edward J.** __The impact of $F$-polynomials in graph theory__. Quo vadis, graph theory?, 173--178, Ann. Discrete Math., **55**, North-Holland, Amsterdam, 1993.

. Beezer, Robert A.; **Farrell, E. J.** __Counting subgraphs of a regular graph__. J. Math. Sci. (Calcutta) **9** (1998), no. 1, 47--55.

. **Farrell, E. J.** __Chromatic roots---some observations and conjectures__. Discrete Math. **29** (1980), no. 2, 161--167.

8. **Farrell, E. J.** __On chromatic coefficients__. Discrete Math. **29** (1980), no. 3, 257--264. [103] 81c:05073 Farrell, E. J. Matchings in wheels. Ars Combin. 8 (1979), 109--115.

7. **Farrell, E. J.** __An introduction to matching polynomials__. J. Combin. Theory Ser. B **27** (1979), no. 1, 75--86.

6. **Farrell, E. J.** __On a general class of graph polynomials__. J. Combin. Theory Ser. B **26** (1979), no. 1, 111--122.

5. **Farrell, E. J.** __On a class of polynomials associated with the stars of a graph and its application to node-disjoint decompositions of complete graphs and complete bipartite graph__. Canad. Math. Bull. **22** (1979), no. 1, 35--46.

4. **Farrell, E. J.** __On a class of polynomials obtained from the circuits in a graph and its application to characteristic polynomials of graphs__. Discrete Math. **25** (1979), no. 2, 121--133.

3. **Farrell, E. J.** __Matchings in ladders__. Ars Combin. **6** (1978), 153--161.

2. **Farrell, E. J.** __On graphical partitions and planarity__. Discrete Math. **18** (1977), no. 2, 149--153.

1. **Farrell, Edward J.** __Uniqueness of the electromagnetic field in the Rainich unified field theory__. Tensor (N.S.) **12** 1962 263--277.