Curriculum vitae

 

Ortrud R. Oellermann

Feb 14, 2013

 

   also available in pdf here

 

 

Address: 

Department of Mathematics and Statistics

The University of Winnipeg

515 Portage Avenue

Winnipeg, MB

R3B 2E9  CANADA

 

Telephone:  (204) 786 9367

Fax:           (204) 774 4134

e-mail:       o.oellermann @  uwinnipeg.ca    [remove the spaces]

 

Degrees Held:

          B.Sc.                                         (1981) University of Natal

          B.Sc. Honours (cum laude)             (1982) University of Natal

          M.Sc. (cum laude)                        (1983) University of Natal

          Ph.D.                                         (1986) Western Michigan University

 

Academic Employment History:

             Jan.-June 1983                      Junior Lecturer, University of Durban-Westville

           Sept. 1986-Aug 1989             Assistant Professor, Western Michigan University

           April 1988-March 1990            Lecturer University of Natal, Durban

           April 1990-October 1993         Senior Lecturer, University of Natal, Durban

           April 1993-July 1996               Adjunct Professor, Brandon University

           July 1996-June 2000              Associate Professor, University of Winnipeg

           July 2000-present                  Professor, University of Winnipeg

 

Professional Memberships:

1.        American Mathematical Society: 1986-1993, 1995, 1997-present.

2.        Institute of Combinatorics and its Applications (Founding Fellow): 1991-present

3.        Canadian Mathematical Society: 1995-present

4.        Member of the Society for Industrial and Applied Mathematics: 1998-present.

 

Scholarly and Professional Activities:

 

August 1987         Invited participant to the Algorithms and Complexity Conference held at Colorado College conducted by H.S. Wilf.

June 1990            Invited participant to the Oberwolfach  Conference on Graph Theory.

 

Professional Service:

 

 

1.                  Serving on the Editorial Board of Utilitas Mathematica, October 1994-present.

2.                  Serving on the Editorial Board of Ars Combinatoria, June 1999-present.

3.       Managing Editor Ars Combinatoria, June 1997-April 1999.

4.       Referee for American Mathematical Monthly, Journal of Graph Theory, Graphs and Combinatorics, Ars Combinatoria, Discrete Applied Mathematics, Discrete Mathematics,

          Journal of Combinatorial Theory Ser(B), Bulletin of Combinatorics and its Applications, Utilitas Mathematica, The Australasian Journal of Combinatorics,

          Quastiones Mathematicae, Aequationes Mathematicae, Electronic Journal of Combinatorics, Journal of Combinatorial Mathematics and Combinatorial Computing.

5.        Reviewer for Mathematical Reviews and Zentralblatt fur Mathematik.

6.        Elected Member of the Council of the Institute of Combinatorics and its Applications (1998-2001).

7.        Elected Member of the Board of Directors of the Canadian Mathematical Society July 2001- June 2005.

8.        Co-director Sixth International Conference on the Theory and Applications of Graphs, Kalamazoo, June 1988.

9.        Co-director of 255th Anniversary of Graph Theory Conference, Durban, July 1991.

10.      Co-director of first Winnipeg Combinatorial Mathematics Conference, University of Winnipeg, Sept. 1998.

11.      Co-director of second Winnipeg Combinatorial Mathematics Conference, University of Winnipeg, Sept. 2000.

12.      Co-director of the Third Prairie Discrete Mathematics Workshop, University of Winnipeg,  August 25 and 26, 2005.

13.      Outside reader Ph.D. Theses: G. Kubicki - Western Michigan University 1989, V. Smithdorf  -University of Natal 1993, L. Eroh - Western Michigan University 2000.

14.      Grant Reviewing The Foundation for Research Development in South Africa.

15.      Grant Reviewing NSERC.

16.      Co-organizer of the Women in Mathematics in Canada conference held in Edmonton, June 2003 and  Banff International Research Station, July 2005.

17.      Reviewer of Wilfred Laurier’s Mathematics Department, January/February 2005.

18.      Canadian Math Olympiad  Assisting with Setting and Marking of exams, Sept. 2002-April 2005.

19.      Education Committee of the Canadian Math. Soc. (Member) January 1, 2006 – December 31, 2007.

20.      Women in Mathematics Committee of the Canadian Math. Soc. 2006-2007(Advisory)

21.      Elected member of the executive committee of the Soc. for Industrial and Appl. Math. (SIAM) activity group for Discrete Mathematics
(office of secretary) January 2006 – December 2007.

22.      Executive committee for the newly formed CanaDAM (member 2006-present and chair of student funding committee-2007)- Biennial Canadian
Conferences on Discrete and Algorithmic Mathematics.

23.      Co-Chair for the SIAM conference on Discrete Mathematics (June 16-19, 2008)

24.      Program committee member for the second CanaDAM conference held in Montreal in May 2009.

25.      Student funding committee chair for CanaDAM 2009.

26.      Member of Organizing Committee for the Science for Life Conference, University of Winnipeg, February 2009.

27.      Co-chairing the Science component of the CCWESTT (Canadian Coalition for Women in Engineering, Science, Trades and Technology) conference
    held in Winnipeg, May 13-15, 2010.

28.      Chair of the Executive committee for the CanaDAM conference to be held in Victoria, June 2011.

29.      Member of the Program Committee for CanaDAM 2013, St.Johns New Foundland, June 2013

30.      Academic Consultant for a Topics in Structural Graph Theory Text (eds. L.W. Beineke and R. Wilson) Cambridge University Press.

 

Awards and Honours:

 

1.        Bronze Medal of the South African Association for the Advancement of Science (1983)

2.        Fulbright Scholar (1983 - 1988)

3.        Vice-Chancellor’s Research Award, University of Natal (1989)

4.        Certificate of Merit South African Association for the Advancement of Science in recognition of devoted service to the advancement of science (1990)

5.        South African Silver British Association Medal (1991)

6.        Royal Society’s Meiring Naude Medal (1994)

7.        Hall Medal of the Institute of Combinatorics and its Applications (1995)

8.        Merit Award, The University of Winnipeg (1997/1998)

9.        Merit Award, The University of Winnipeg (2001/2002)

10.       Erica and Arnold Rogers Award for Excellence in Research (University of Winnipeg – 2003).

11.       Merit Award, The University of Winnipeg (2002/2003)

12.       Merit Award, The University of Winnipeg (2003/2004)

13.       Merit Award, The University of Winnipeg (2004/2005)

14.       Merit Award, The University of Winnipeg (2005/2006)

15.       Merit Award, The University of Winnipeg (2007/2008)

16.       Merit Award, The University of Winnipeg (2008/2009)

17.                  Merit Award, The University of Winnipeg (2010/2011)

18.                  Merit Award, The University of Winnipeg (2011/2012)

 

 

 

Current Areas of Scholarly Interests:

 

Graph Theory with emphasis on distance notions in graphs including graph convexity, graph connectivity and the path partition conjecture for oriented graphs.

 

 

Courses Taught (last seven years):

 

2003:      Introduction to Calculus(Fall), Graph Theory(Fall)

2004:     Introduction to Calculus(Winter), Graph Theory and Combinatorial Optimization(Winter)

                 Introduction to Calculus (Fall), Introduction to Operations Research (Fall).

2005:     Introduction to Calculus (Winter), Networks and Applications (Winter)

                Introduction to Calculus (Fall), Group Theory (Fall)

2006:     Introduction to Calculus (Winter), Rings and Fields (Winter)

             Basic Calculus (Fall); Discrete Mathematics (Fall)

2007:     Introduction to Calculus (Fall); Discrete Mathematics (Fall)

2008:     Introduction to Calculus (Winter); Advanced Graph Theory and Combin. Optimization (Winter)

2008:     Introduction to Calculus I (Fall); Combinatorics (Fall)

2009:     Introduction to Calculus II (Winter); Networks (Winter)

2009:     Introduction to Calculus I (Fall); Group Theory (Fall)

2010:     Discrete Mathematics (Fall)

2011:     Introduction to Calculus II (winter), Discrete Mathematics (Winter), Discrete Math (Fall)

2012:     Advanced Graph Theory (Winter), Rings and Fields (Winter-reading course), Group Theory (Fall)

2013:      Discrete Mathematics (Winter)

 

 

Supervisorships:

 

1.           Mr. Dave I. Carson, M.Sc. (1991) Planarity testing and embedding algorithms.

2.           Mr. Stewart W. Melville, Ph. D. (1992) A practical investigation of meteor burst communication. (Served as co-supervisor with Dr. A. Satori-Angus as supervisor.)

3.           Mr. Dave P. Day, Ph.D. (1994) (Served as co-supervisor with Dr. H.C. Swart as supervisor.)

4.           Mr. Dave I. Carson, Ph.D. (1994) Aspects of domination in graphs.

5.           Mr. William Pensaert, Summer 1997 project – Steiner centres and Steiner medians of graphs and the average connectivity of a graph.

6.           Mr. William Pensaert, Summer 1998 project – Broadcasting in graphs.

7.           Ms. Nadia Howlader, Summer 1998 (USRA recipient) -- Broadcasting in graphs.

8.           Mr. William  Pensaert, Summer 1999 project – Maximum average connectivity in oriented graphs.

9.           Ms. Jennifer  Prokop, Summer 2000 (USRA recipient) -- The probabilistic method and the average connectivity of an oriented graph.

10.          Ms. Shonda Gosselin, Summer 2002 (USRA recipient) and Ms. M. Fehr --The metric dimension of Cayley digraphs.

11.          Ms. Shonda Gosselin and Ms. M. Fehr, Summer 2003 -- The partition dimension of Cayley digraphs.

12.          Ms Charlene Pawluck 2003/2004 Research assistant – The metric dimension of Cayley digraphs.

13.          Mr. Joel Peters-Fransen, Summer 2004 (USRA recipient) – (i) The metric dimension of products of cycles and (ii) The strong metric dimension of a graph.

14.          Ms. Stephanie Phillips, Summer 2005 -- Steiner intervals and the Steiner geodetic number of a graph.

15.          Dr. Morten Nielsen, November 1, 2006 - August 31, 2007 (post-doctoral fellow) –(i)  k-Traceability in graphs and digraphs and the path partition
        conjecture and (ii) Steiner convexity in graphs.

16.          Mr Iain Crump, Summer 2008 (USRA recipient)—(i) Elimination orderings of graphs and (ii) rainbow colouring numbers of graphs  3-Steiner Simplicial Elimination Orderings

17.          Ms. Terri May, Summer 2008 and 2009; Strong metric dimension of distance hereditary graphs.

18.          Dr. Morten Nielsen, February 2010 – June 2010 (post-doctoral fellow) (i) Convexity and Helly numbers; (ii) Graph classes characterized by local convexities.

19.                       Mr Randy Yee, Summer 2012, Heuristics for approximating the metric dimension of a graph.

20.                       Mr Yizhe Zhang, Summer 2012, Heuristics for approximating the metric dimension of a graph.

21.         Rachel Anderson, MSc student University of Victoria, 2010-2013 co-supervised with Gary MacGillivray, Elimination orderings in graphs.

 

 

Research Funding:

 

Peer Reviewed:

 

1.            Office of Naval Research Grant. October 1987- August 1989 (with G. Chartrand)

2.            President’s Award, Foundation for Research Development in South Africa. January 1989 - December 1993. Annual amount of about $60 000.

3.            NSERC Grant Canada. .April 1994 – March 1997. On the average Steiner distance of a graph. Annual amount $ 8 000.

4.            NSERC Grant Canada. April 1997- March 2000. Average graph parameters, augmentation problems and generalizations of Menger’s theorem.
        Annual amount $12 500 - $ 14 438.

5.            NSERC Discovery Grant Canada. April 2000- March 2004.  Network reliability measures and distance parameters in graphs. Annual amount $16 500. (Deferred one year)

6.            NSERC Discovery Grant Canada. April 2005-March 2010. Annual amount $16 000 (Extended for 1 year without additional funding)

7.            NSERC Discovery Grant Canada, April 2011-March 2016. Total of $50 000 over five years. 

 

Internal:

 

1.            College of Arts and Sciences and Graduate College Research Assistantships, Western Michigan University, 1984

2.            Start up grant, University of Winnipeg, $ 5 000.

 

Lifetime Publications:

 

Books:

 

1.              Refereed Proceedings of the 6th Kalamazoo International Conference on the Theory and Applications of Graphs. John Wiley and Sons, New York.
       Publication date 1991. (Co-edited with Y. Alavi, G. Chartrand, and A.J. Schwenk.)

2.              Applied and Algorithmic Graph Theory. McGraw Hill, New York, 1993. (Co-authored with G. Chartrand.)

3.              Academic Consultant for Topics in Structural Graph Theory, (eds., L.W. Beineke and R.J. Wilson) Cambridge University Press, 2013.

 

 

Peer Reviewed Journal Articles:

 

1984

1.              Graphs for which all strong orientations are Eulerian. Exposition  Math. 2 (1984) 183-184. (with H.C. Swart)

 

 

1985

2.              Randomly n-cyclic digraphs. Graphs and Combin. 1 (1985) 29-40. (with G. Chartrand and S. Ruiz.)

3.              On the regulation number of a multigraph. Graphs and Combin. 1 (1985) 137-144. (with G. Chartrand and F. Harary)

4.              Some applications of graph theory. Bull. Bombay Math. Colloq. 2 (1985) 55-78. (with G. Chartrand)

 

1986

5.              Randomly H graphs.  Math. Slovaca.  36 (1986) 126-136. (with G. Chartrand and S. Ruiz)

6.              An Eulerian exposition.  J.Graph Theory.  10 (1986) 277-297. (with L. Lesniak)

7.              Bipartite regulation numbers. Discr. Math. 62 (1986)113-118. (with Y. Alavi, G. Chartrand and L. Lesniak)

8.              The uniformity number of a graph. Indian J. Math. 28 (1986) 1-7. (with G. Chartrand, F. Saba and H.B. Zou)

9.              Connected graphs containing a given connected graph as a unique greatest common subgraph. Aequationes Math.  31 (1986) 213-222. (with G. Chartrand and M. Johnson)

 

1987

10.             Highly irregular graphs. J.Graph Theory  11 (1987) 235-249. (with Y. Alavi, G. Chartrand, F.R.K. Chung, P. Erdos and R.L. Graham)

11.             On the l-connectivity of a graph. Graphs and Combin.  3 (1987) 285-291.

12.             F-degrees in graphs. Ars Combinatoria 24 (1987) 133-148. (with G. Chartrand, K.S. Holbert and H.C. Swart)

13.             Maximum matching in cubic graphs with a bounded number of bridge covering paths. Bull. Austral. Math. Soc. 36 (1987) 441-447. (with G. Chartrand and S.F. Kapoor)

 

1988

14.             How to define an irregular graph. College Math. J. 19 (1988) 36-42. (with G. Chartrand and P.Erdos)

15.             The connected cutset connectivity of a graph. Discr. Math.  69 (1988) 301-308.

16.             Variations on a theorem of Petersen. Period. Math. Hungar. 19 (1988) 241-247. (with K.S. Bagga, L.W. Beineke, and G. Chartrand)

17.             The F-connectivity of a graph. Scientia 1 (1988) 65-71. (with P.J. Malde)

 

1989

18.             Greatest common subgraphs with specified properties.  Graphs and Combin. 5 (1989) 1-14. (with G. Chartrand, F. Saba and H.B. Zou)

19.             Major n-connected graphs.  J. Austral. Math. Soc. 47 (1989) 43-52.

20.             A matter of degree.  SIAM J. Discr. Math. 2 (1989) 456-466. (with G. Chartrand, H. Hevia, F. Saba and A.J. Schwenk)

21.             Steiner distance in graphs.  Casopis Pest. Mat. 114 (1989) 399-410. (with G. Chartrand, S. Tian and H.B. Zou)

 

 

1990

22.             On the Steiner radius and Steiner diameter of a graph. Ars Combinatoria 29C (1990) 13-19. (with M.A. Henning and H.C. Swart)

23.             Steiner numbers in graphs. Quaestiones Math. (1990) 159-164.

24.             Steiner centers in graphs. J. Graph Theory 14 (1990) 585-597. (with S. Tian)

25.             What graphs are these? South African J. Science 86 (1990) 190-191.

26.             A new approach to distance stable graphs. J. Combin. Math. Combin. Comput. 8 (1990) 209-220. (with W.D. Goddard and H.C. Swart)

 

1991

27.             Conditional connectivity defined by hereditary properties. NETWORKS 21 (1991) 245-255.

28.             On multipartite tournaments. J. Combin. Theory Ser.(B) 52 (1991) 284-300. (with W.D. Goddard, G. Kubicki and S. Tian)

29.             Bounds on distance domination.  J. Comp. Inf. Syst. Sc. 16 (1991) 11-18. (with M.A. Henning and H.C. Swart)

30.             Subgraph distance in graphs. J. Comp. Inf. Syst. Sc. 16 (1991) 67-85. (with G. Chartrand, K.S. Holbert and G.L. Johns)

31.             The l-connectivity function of trees and complete multipartite graphs. J. Combin. Math. Combin. Comput.10 (1991) 183-192. (with D.P. Day and H.C. Swart)

 

1992

32.             A new algorithm for finding an upper bound for the genus of a graph. South African Computer J. 8 (1992) 12-23. (with D.I. Carson)

 

1993

33.             Distance hereditary graphs and multidestination message routing in multicomputers. J. Combin. Math. Combin. Comput. 13 (1993) 213-222. (with A. Esfahanian)

34.             Which trees are uniquely framed by the Heawood graph? Quaestiones Mathematicae 16(3) (1993) 237-251. (with W.D. Goddard, M.A. Henning and H.C. Swart)

35.             Some general results on the framing number of a graph. Quaestiones Mathemticae 16(3) (1993) 289-300. (with  W.D. Goddard, M.A. Henning and H.C. Swart)

 

1994

36.             Relationships between distance domination parameters.  Mathematica Pannonica 5(1) (1994) 69-79.(with M.A. Henning and H.C. Swart)

37.             Steiner distance hereditary graphs. SIAM J. Discr. Math. 7 (1994) 437-442.

38.             Steiner distance stable graphs. Discr. Math.  132(1994) 65-73. (with W.D. Goddard and H.C. Swart)

39.             The l-connectivity of a digraph. Discr. Math. 127(1994) 95-104. (with D.P. Day and H.C. Swart)

 

1995

40.             From Steiner centers to Steiner medians in graphs. J. Graph Theory 20 (1995) 113-122.

41.             Relating pairs of distance domination parameters. J. Combin. Math. Combin. Comput. 18 (1995) 233-244. (with M.A. Henning and H.C. Swart)

42.             On a polynomial algorithm for testing whether a graph is 3-Steiner distance hereditary. Inform. Proc.Letters 55 (1995) 149-154. (with J. Spinrad)

 

1996

43.             The average Steiner distance of a graph. J. Graph Theory 22 (1996) 15-22. (with P. Dankelmann and H.C. Swart)

44.             On the Steiner median of a tree. Discr. Appl. Math. 68 (1996) 249-258. (with L.W. Beineke and R.I. Pippert)

45.             An algorithm to find two distance domination parameters in a graph. Discr. Appl. Math. 68 (1996) 85-91. (with G. Fricke, M.A. Henning and H.C. Swart)

46.             On the diversity of domination. Discr. Math. 101 (1996) 161-173.

47.             Local edge-domination critical graphs. Discr. Math. 101 (1996) 175-184. (with M.A. Henning and H.C. Swart)

 

1997

48.             The chromatic number of a factorization of a graph.  Bull. Inst. Combin. Applic. 20 (1997) 33-56.

49.             A characterization of 3-Steiner distance hereditary graphs. NETWORKS 30 (1997) 243-253. (with D.P. Day and H.C. Swart.

50.             The irregularity cost of a graph. Computers and Mathematical Applications. 34 (1997) 59-63. (with F. Harary)

51.             On the average Steiner distance of a graph with prescribed properties.  Discr. Appl. Math. 79 (1997) 91-103. (with P. Dankelmann and H.C. Swart)

 

1998

52.             On three conjectures of GRAFFITI.  J. Combin. Math. Combin. Comput. 26 (1998) 131-137. (with P. Dankelmann and H.C. Swart)

53.             Steiner intervals in graphs. Discr. Appl. Math.  81 (1998) 181-190. (with E. Kubicka and G. Kubicki)

54.             Bipartite Ramsey theorems for multiple copies of . Utilitas Mathematica. 54 (1998) 13-23. (with M.A. Henning)

55.             Bounds on the size of graphs with given order and l-connectivity. Discr. Math. 198 (1998) 217-223. (with D.P. Day and H.C. Swart)

 

1999

56.             On Steiner centers and Steiner medians of a graph. NETWORKS. 34 (1999) 258-263.

 

2000

57.             Bounds on the total redundance and efficiency of a graph. Ars Combinatoria 54 (2000) 129-138. (with W.D. Goddard, P. Slater and H.C. Swart)

58.             Resolvability in graphs and the metric dimension of a graph. Discr. Appl. Math. 105 (2000) (with G. Chartrand, L. Eroh and M. Johnson)

59.             On the irregularity cost of a tree. J. Combin. Math. Combin. Comput. 33 (2000) 181-192.

60.             Bipartite Ramsey numbers and Zarankiewicz numbers.  Discr. Math. 219 (2000) 85-95. (with M.A. Henning and W.D. Goddard)

 

 

2001

61.             The average connectivity of regular multipartite tournaments. Austral. J. Combin. 23 (2001) 101-113. (with M.A. Henning)

62.             The metric dimension and metric independence of a graph. J. Combin. Math. Combin. Comput. (2001) (with J. Currie)

 

2002

63.              Augmenting trees so that every three vertices lie on a cycle. Discr.Appl. Math. 116(2002) 145-159. (with P.Dankelmann, W.D. Goddard and H.C. Swart)

64.              The average connectivity of a graph. Discr. Math. 252(2002) 31-45 (with L.W. Beineke and R.I. Pippert)

65.              The upper domination Ramsey number u(3,3,3). Discr. Math. (with M.A. Henning)

 

2003

66.              On m-chromatic factorizations of complete graphs. J. Combin. Math and Combin. Comput. 47 (2003) 3-17. (with G. Chartrand and H. Hevia)

67.              Bounds on the average connectivity of a graph. Discr. Appl. Math.  129 (2003) 305-318. (with P.                 Dankelmann)

68.              Distance domination critical graphs.  J. Combin. Math. and Combin. Comput. 44 (2003) 33-45. (with M.A. Henning and H.C. Swart)

 

2004

69.              On upper domination Ramsey numbers for graphs. Discr. Math. 274 (2004) 125-135. (with M.A. Henning)

70.              Bipartite rainbow ramsey numbers. Discr. Math. 277 (2004) 57-72. (with L.Eroh)

71.              The average connectivity of a digraph.  Discr. Appl. Math. 140 (2004) 143-153. (with M.A. Henning).

72.              Metric-locating dominating sets in graphs. Ars. Combin. 73 (2004) 129-141. (with M.A. Henning).

73.              Minimum average distance of orientations of graphs. Discr. Appl. Math. 143 (2004) 201-212.

 

2005

74.              Degree sequences of optimally edge-connected graphs. Ars Combin. 77 (2005) 161-168. (with P. Dankelmann)

75.              Rebuilding convex sets in graphs. Discr. Math. 293 (2005) 26-37 (with J. Caceres, A. Marquez and M.L. Puertas)

76.              The directed path partition conjecture. Discussiones Math. Graph Theory 25 (2005) 26-37 (with M. Frick, S. van Aardt, G. Dlamini and J. Dunbar)

 

2006

78.               The metric dimension of Cayley digraphs, Discr. Math. 306 (2006) 31-41 (with M. Fehr and S. Gosselin)

79.               The partition dimension of Cayley digraphs, Aequationes Math. 71 (2006) 1-18 (with M. Fehr and S. Gosselin)

80.               The metric dimension of Cartesian products of graphs. Utilitas Mathematica 69 (2006) 33-41 (with J. Peters-Fransen)

81.               The metric dimension of Cayley digraphs of abelian groups.  Ars Combin.  (with C. Pawluck and A. Stokke)

 

 

2007

82.               Steiner intervals and Steiner geodetic numbers in distance hereditary graphs. Discr.  Math. 307 (2007) 88-96. (with M.L. Puertas)

83.               The strong metric dimension of graphs and digraphs. (with J. Peters-Fransen) Discrete Applied Mathematics 155 (2007) 356-364.

 

2008

84.             Geodetic and Steiner geodetic sets in 3-Steiner distance hereditary graphs. (with L. Eroh) Discrete Mathematics. 308 (2008) 4212-4220.

85.             A traceability conjecture for oriented graphs (with S. van Aardt, J. Dunbar, M. Frick, and M. Nielsen) Electronic J. Combinatorics 15(1) (2008) No  R150.

 

2009

86.            Steiner intervals in strongly chordal graphs. (with S. Phillips) Journal of Combinatorial Mathematics and Combinatorial Computing. 68 (2009) 19-31.

87.            Local Steiner convexity (with M. Henning and M. Nielsen) European J. of Combinatorics. 30(2009) 1186-1193.

88.            Steiner trees and convex geometries (with M. Nielsen) SIAM Journal on Discrete Mathematics 23 No.2 (2009)

89.            Detour saturated oriented graphs. (with S.A. van Aardt, M. Frick, and J. Dunbar) Utilitas Math.79 (2009) 167-180.

90.            On 3-Steiner simplicial orderings of graphs. (with J. Caceres) Discrete Mathematics. 309 (2009) 5828-5833.

 

2010

91.           Traceability of k-traceable Oriented Graphs. (with S. van Aardt, J. Dunbar, M. Frick, P. Katrenic and M. Nielsen) Discr.  Math. 310 (2010) 1325-1333.

 

2011

92.          Hamiltonicity of k-traceable graphs. (with F. Bullock, P. Dankelmann, M. Frick, M.A. Henning and S. van Aardt) Electronic J. of Combinatorics 18 (2011) # P63 

93.          Helly Theorems for 3-Steiner and 3-Monophonic Convexity in Graphs, (with M. Nielsen) Discrete Mathematics 311 (2011) 872-880.

94.                  The strong dimension of distance hereditary graphs. (with T. May) J. Combin. Math and Combin. Comput. 76 (2011) 59-73.

 

2012

95.          Local 3-monophonic convexity. (with M. Nielsen) J. Combin. Math and Combin. Comput. 80 (2012)11-24

96.          Separation properties for 3-Steiner and 3-monophonic convexity in graphs. Discrete Mathematics 312 (2012) 3293-3305.(with M. Nielsen)

97.          Induced trees and monophonic convexity (with J. Caceres and M.L. Puertas) Discussiones Math Graph Theory 32 (2012) 685-704.

98.          Characterization of k-traceable graphs and oriented graphs (with S. van Aardt, J. Dunbar, M. Frick and M. Nielsen) Utilitas mathematica 90 (2013), 269-281

 

 

Articles submitted for Publication:

99.        On domination and digital convexity parameters. (sole author) (J. Combin. Math. and Combin. Comput.)

 

Articles submitted for publication in refereed journals:

100.                  Graphs with a minimal number of convex sets (with Jason Brown)

 

Book Chapter in Structural Analysis of Complex Networks (edited by Matthias Dehmer) Birkauser (2009) ISBN 978-0-8176-4788-9 (Chapter: Distance in Graphs (with Wayne Goddard))

 

Book Chapter in Topics in Structural Graph Theory (edited by L.W. Beineke and R. J. Wilson) Cambridge University Press. (Chapter 1: Menger’s Theorem (2013) 13-39.)

 

Journal Abstracts:

 

1993

  1. The irregularity cost or sum of a graph. Appl. Math. Lett. 6 (1993) 79-80. (with F. Harary, M.S. Jacobson, E. Kubicka and G. Kubicki)

 

Proceedings of meetings: (Peer Reviewed)

 

1987

  1. The ascending subgraph decomposition problem.  Congressus Numerantium. 58 (1987) 7-14. (with Y. Alavi, A.J. Boals, G. Chartrand and P. Erdos)
  2. A note on the l-connectivity function of a graph.  Congressus Numerantium  60 (1987) 181-188.

 

1988

  1. An introduction to Eulerian graphs. Proc. 250th Anniversary Conf. on Graph Theory. Congressus Numerantium. 64 (1988) 7-12. (with L. Lesniak)
  2. Degree representative trees in graphs. Proc. 250th Anniversary Conf. on Graph Theory. Congressus Numerantium. 64 (1988) 73-79. (with G. Chartrand and H.C. Swart)
  3. Irregular networks. Proc. 250th Anniversary Conf. on Graph Theory. Congressus Numerantium. 64 (1988) 197-210. (with G. Chartrand, M.S. Jacobson, J. Lehel, S. Ruiz and F. Saba)
  4. k-Path irregular graphs. Congressus Numerantium 65 (1988) 201-210. (with Y. Alavi, A.J. Boals, G. Chartrand and P.Erdos)

 

1989

  1. On the edge-independence number of a regular graph with large edge connectivity. Proc. of 3rd Intrenational conference on  Combin. Math.
    (eds. G. Bloom, R.L. Graham and J. Malkevitch) Annanls of the New York Academy of Sciences 555 (1989) 94-102. (with I. Broere, G. Chartrand and C. Wall)
  2. Degree uniform graphs. . Proc. Of 3rd Intrenational conference on  Combin. Math. (eds. G. Bloom, R.L. Graham and J. Malkevitch) Annanls of the New York Academy of
    Sciences     555 (1989) 122-132. (with G. Chartrand, L. Lesniak and C.M. Mynhardt)

 

1990

  1. Least common supergraphs of graphs. Congressus Numerantium 72 (1990) 109-114. (with G. Chartrand, H. Hevia, G. Kubicki, F. Saba and H.B. Zou)

 

1991

  1. On the cycle structure of multipartite tournaments. Proc. of the 6th Quadrennial International Kalamazoo Conference on the Theory and Applications of Graphs.
    John Wiley and Sons, New York     (1991) 525-533. (with W.D. Goddard)
  2. On vertices with maximum Steiner eccentricity in graphs. Graph Theory, Combinatorics, Algorithms and Applications. (eds. Y. Alavi, F.R.K. Chung, R.L. Graham, and D.F. Hsu)
    SIAM Publications.      (1991) 393-403. (with M.A. Henning and H.C. Swart)
  3. Distance: A graphical tour.  Graph Theory, Combinatorics, Algorithms and Applications. (eds. Y. Alavi, F.R.K. Chung, R.L. Graham and D.F. Hsu) (with G. Chartrand and M. Schultz)
  4. A new algorithm for finding an upper bound for the genus of a graph. Proc. 6th South African Computer Symposium (1991)276-315. (with D.I. Carson)

 

1994

  1. Steiner distance in graphs with emphasis on eccentricity measures: A survey. Congressus Numerantium   99  (1994) 206-211.
  2. Computing the average distance of distance hereditary graphs in linear time.  Congressus Numerantium  103 (1994) 219-223.

  

1995

  1. Unique Steiner eccentric graphs.  Proc. Of the 7th Quadrennial Conferenceon the Theory and Applications of Graphs. (1995) 1123-1134. (with M.A. Henning and H.C Swart)

 

1996

  1. Menger-type results for three or more vertices.  Congressus Numerantium (Nash-Williams retirement Volume) 113 (1996) 179-204.
  2. Connectivity and edge-connectivity in graphs: A survey.  Congressus Numernatium 115/116 (1996)231-252.

 

Not Peer Reviewed:

 

Contributions to Books:   

 

1989

    20.    Steiner n-eccentricity sequences of graphs.  Recent Studies in Graph Theory. (eds. V.R. Kulli) Vishwa International Publications. (1989) 206-211. (with S. Tian)

   21.    The mean integrity of a graph. Recent Studies in Graph Theory. (eds. V.R. Kulli) Vishwa International Publications. (1989) 70-80. (with G. Chartrand, S.F. Kapoor and T.A. McKee)

 

1990

    22.    On the Steiner periphery and Steiner eccentricity of a graph. Topics in Combinatorics and Graph Theory (eds. R. Bodendiek and R. Henn)
            Physica Verlag Heidelberg (1990) 541-547. (with H.C. Swart)    

   23.    On peripheral vertices in graphs. Topics in Combinatorics and Graph Theory (eds. R. Bodendiek and R. Henn) Physica Verlag Heidelberg (1990) 193-199.
            (with G. Chartrand and G.L. Johns)

   24.    The theory and applications of greatest common subgraphs.  Contemporary Methods in Graph Theory (ed. R. Bodendiek) Wissenschaftsverlag, Mannheim (1990) 621-638.
            (with G. Chartrand, M. Johnson and G. Kubicki)


2011

    25.         m_3^3-convex geometries are A-free. arXiv:1107:1048 (with J. Caceres and M.L. Puertas – 15 pages)

 

Proceedings of Meetings:

 

1988

 

Explorations into graph connectivity.  Notices South African Math. Soc. 20 (1988) 117-151.

 

Unpublished Documents:

 

1.       Aspects of high traceability in graphs: M.Sc. Thesis, University of Natal (1983).

2.       Connectivity in Graphs: PhD Thesis, Western Michigan University (1986).

3.       Introductory Calculus Text. (Co-authored with B. Bector, J. Currie, J. Ginsburg, D. Grant, V. Linek and T. Visentin.)

 

 

Invited Lectures and Plenary Conference Presentations  (since joining the University of Winnipeg)

 

Since 1996

1.      The average connectivity of graphs and digraphs. Symposium given at the 32nd Midwest Graph Theory Meeting at Indiana University-Purdue University at Fort Wayne. Oct. 28-30, 1999.

2.      Steiner distances in graphs: A survey. The ninth Quadrennial International Conference in Graph Theory, Combinatorics, Algorithms and Applications at Western Michigan University,

            Kalamazoo Michigan, June 4-9, 2000.

3.      Steiner distance in graphs and centrality measures and structures. An all Institute presentation at the DIMACS conference on Distance and Centrality Concepts in Graphs held

            at RUTCOR Rutgers University, New Jersey USA, July 17-21, 2000.

4.      The average connectivity of a graph. Presented at the South African International Graph Theory Conference held at Ithala, Natal, South Africa, June 18-22, 2001.

5.      Steiner geodetic numbers in graphs. Presented at the joins AMS/RSME meetings held in Seville Spain, June 2003.

6.      Contour vertices and their application to convexity notions in graphs. Presented at the First Prairie Discrete Mathematics Workshop, University of Regina, October 2003.

7.      Contour vertices and their application to convexity notions in graphs. Presented at the Eighteenth Clemson Mini-Conference on Combinatorial Optimization, University of

            South Carolina, Clemson USA, October 2003.

8.      Contour vertices and convexity notions in graphs. Presented at the Graphs and Matroids Session of the Canadian Math. Soc. Meetings, Vancouver, December 2003.

9.      Distance, Dimension and Detecting Locations in Networks, Presented at the Women in Science conference, University of Winnipeg, November 2005.

10.     Convexity notions in graphs. Presented at the International Workshop on Metric and Convex Graph Theory. Barcelona Spain, June 2006.

11.     The strong metric dimension of graphs. Presented at the Canadian Math. Soc. Meetings, Victoria, December 2006.

12.     Steiner convex geometries. Presented at the Summer meetings of the Canadian Mathematics Society in a special Finite Combinatorics Session, Winnipeg, June 1-3, 2007.

13.     Exploring Mathematical Networks. Presented as part of the Brown Bag Lecture Series at the University of Winnipeg, Sept, 2007.

14.     Local Convexity in Graphs. Presented at the Ottawa-Carleton Discrete Mathematics days, Carleton University, May 8-11, 2008 (expenses covered by the Fields Institute).

15.     Local Convexity in Graphs. Presented at the 5th Prairie Discrete Mathematics Workshop, held at the University of Manitoba, May 29-30, 2008.

16.     On Graph Classes determined by Convexity in Graphs. Presented as part of an invited minisymposium of the SIAM meeting for Discrete Mathematics, held at
Burlington Vermont USA, June 16-19, 2008.

17.     Graph Classes Determined by Convexity Notions in Graphs.  Presented in the special session on Extremal and Probabilistic Combinatorics at the AMS Central Section
Meeting in St. Paul, April 10-11, 2010.

18.     The different dimensions of distance in graphs. Presented at the Prairie Network for Research in the Mathematical Sciences. Winnipeg, May 1-2, 2010.

19.        Convexity of graphs. Presented at the Prairie Discrete Math Workshop University of Calgary, May 4&5, 2012.

20.              The average connectivity of graphs and digraphs. Presented in the Combinatorics session of the Canadian Math. Society, June 1-5, 2012.

21.              Invited mini symposium organizer on Structural Graph Theory at the Society for Industrial and Applied Mathematics (SIAM) Discrete Mathematics conference held in Halifax NS, June 18-21, 2012. Talk presented in this mini symposium: Convexity and Graph Classes.

 

 

 

Contributed presentations at conferences 

 

Since 1996

1.       Menger-type results for three or more vertices. 27th Southeastern  International Conference on Combinatorics, Graph Theory and Computing, Baton Rouge, Louisiana,  Feb. 1996.

2.       Augmenting trees so that every three vertices lie on a cycle. 28th Southeastern International Conference on Combinatorics, Graph Theory and Computing, Boca Raton, Florida, March 1997.

3.       A characterization of 3-Steiner distance hereditary graphs. Annual meetings of the Canadian Math. Soc., Winnipeg, June 1997.

4.       The average connectivity of a graph. SIAM conference on Discrete Mathematics, July 1998.

5.       The average connectivity of a graph. 30th Southeastern International Conference on Combinatorics, Graph Theory and Computing, Boca Raton, Florida, March 1999.

6.       The average connectivity of a digraph. Tenth SIAM conference on Discrete Mathematics, Minneapolis, Minnesota, June 12-15, 2000.

7.       Bipartite rainbow Ramsey numbers. Presented at the Winter meetings of the Canadian Math. Soc. Dec. 2001.

8.       The strong metric dimension of graphs. Presented at the 20th British Combinatorial Conference, Durham England, July 2005.

9.       Geodetic sets in 3-Steiner distance hereditary graphs. Presented at the Society for Industrial and Applied Mathematics (SIAM) conference on Discrete Mathematics held in Victoria BC, June 2006.

10.      On 3-Steiner simplicial elimination. Presented at the First Canadian Discrete and Algorithmic Mathematics (CanaDAM) conference, Banff, May 27-31, 2007

11.      Induced trees and monophonic convexity. Presented in a contributed minisymposium “Graph Classes and their Structures” at the CanaDAM meeting, Montreal, May 25-28, 2009.

 

 

Administrative responsibilities:

 

2002-03 (on Sabbatical)

 

2003-04

Department: Visiting lecture Committee (chair), DPC (member), Curriculum Committee (member) Search committee for chair (chair)

University: FCAS Nominating committee (member); Research Capacity Development proposal committee (member)

 

 

2004-05

Department:  DPC(member); Curriculum Committee (member); Honours and reading course committee (chair).

University: FCAS Nominating committee (member); Review committee for director of TSC (member); Canada Research Chair Nominating Committee (member)

 

2005-06

Department: Honours and Reading Course Committee (chair); Research Committee (chair)

University: Canada Research Chair Nominating Committee (member); Erica and Arnold Rogers Awards Committee (member)

 

2006-07

Department: DPC (chair) (Fall); Awards Committee (chair) (Fall) – on Sabbatical during Winter term.

University: Search Committee for new VP Academic Research (member)

  

2007-08

Department: DPC (chair); Dept. Seminar (chair); Dept. mentor.

University:  Organizing committee for ‘Sciences for Life Conference’ (member)

 

2008-09

Department: DCC (chair); Dept Seminar (chair); Dept. Mentor

 

2009-10

Department: DCC (member); DPC (member); Advising co-ordinator.

 

2010-11

Department: DCC (member); DPC (member); Seminar and Visiting Lecturer (Chair); Advising co-ordinator.

University: Senate Curriculum Committee, Senate, Science Council, Science Chairs

 

2011-12

Department: DCC (member); DPC (non-voting member)

University: Senate Curriculum Committee, Senate, Science Council, Science Chairs

 

2011 (July) – 2014(June) 

Department: co-chair (with Terry Visentin)