Dr. Kevin Vander Meulen

Professor of Mathematics

Director of Research

Phone: (905) 648-2139   Ext:4238

Email: kvanderm@redeemer.ca

Office: 221G

Programs: Mathematics


Ph.D. (1995), Mathematics and Statistics, Queen’s University

M.Sc. (1991), Mathematics and Statistics, Queen’s University

B.Sc. Hon (1989), Mathematics, Calvin College


  • Introductory Linear Algebra (MAT-126)
  • Computer Programming I (CSC-121)
  • Discrete Mathematics (MAT-217)
  • Statistics (MAT-215)
  • Graph Theory (MAT-317/417 )
  • Mathematical Biology (MAT-318)
  • Modern Geometry (MAT-321)
  • Abstract Algebra (MAT-331/431)
  • Linear Algebra (MAT-336/436)
  • Honours Research Project (MAT-490)


Kevin Vander Meulen is Professor of Mathematics at Redeemer University, and has taught at Redeemer since 1994. He enjoys teaching a wide variety of mathematics courses. He has also enjoyed the opportunity to hire students over each summer since 1999 to explore research problems in mathematics. Many of his journal articles are co-authored with students. He lives with his family in Hamilton and enjoys canoeing, hiking and cycling.

Research Interests

  • Linear algebra: combinatorial matrix analysis, sign patterns, inertia
  • Graph theory: decomposition problems, eigenvalue problems
  • History/philosophy of mathematics

Recent Research Funding

  • Combinatorial matrix analysis and algebra, NSERC Discovery Grant 2016-2021

Some Recent Publications

F.M. Abdelmalek, E. Vander Meulen, K. Vander Meulen, and A. Van Tuyl, “Well-covered token graphs,” Discussiones Mathematicae Graph Theory, in press, Feb. 15, 2021.

L. Duong, B. Kroschel, M. Riddell, K. Vander Meulen, and A. Van Tuyl, “Maximum nullity and zero forcing of circulant graphs.” Special Matrices 8 (2020) 221–234.

M. Cavers, J. Fischer, and K. Vander Meulen, “Spectral properties of sign patterns.” Electronic Journal of Linear Algebra 30 (2020) 183–197.

L. Deaett, Jonathan Fischer, C. Garnett, and K. Vander Meulen, “Non-sparse companion matrices.” Electronic Journal of Linear Algebra 35 (2019) 223–247.

J. Baker, K. Vander Meulen, and A. Van Tuyl, “Shedding vertices of vertex decomposable well-covered graphs.” Discrete Mathematics 341 (2018) 3355–3369.

K. Vander Meulen and T. Vanderwoerd, “Bounds for roots of polynomials using intercyclic companion matrices. Linear Algebra and its Applications, 539 (2018) 94–116.

Some Recent Presentations

“Sign patterns that allow arbitrary inertia” mini-symposium on the inverse eigenvalue problem for graphs, SIAM (Society for Industrial and Applied Mathematics), Conference on Applied Linear Algebra, virtual, May 19, 2021.

“Maximum nullity and zero forcing of circulant graphs,” ILAS 2019 Conference (International Linear Algebra Society), Fundação Getulio Vargas, Rio de Janeiro, Brazil, July 8, 2019.

“On spectral properties of sign patterns,” AMS special session on Combinatorial Matrix Theory, AMS Sectional Meeting (American Mathematical Society), Auburn University, AL, March 17, 2019.

“Approaching history with graph theory – a review,” Biennial Conference of the ACMS (Association for Christians in the Mathematical Sciences), Indiana Wesleyan University, IN, May 30, 2019.

“Well-covered and vertex decomposable graphs,” Prairie Discrete Mathematics Workshop, Brandon, MB, June 14, 2018.

Professional Memberships and Associations

Cross Appointments

Adjunct Professor of Mathematics, Department of Mathematics and Statistics, McMaster University