Refereed Publications

76.   Jason I. Brown and Julia Tufts, On the Roots of DominationPolynomials, Graphs and Combinatorics, accepted for publication.

75.   Jason I. Brown, Aysel Erey and Jian Li, Extremal Restraints for Graph Colourings, Journal of Combinatorial Mathematics and Combinatorial Computing, accepted for publication.

74.   Jason I. Brown, Karl Dilcher and Dante Manna, Expected Independence Polynomials, Journal of Graph Theory, accepted for publication.

73.   Jason I. Brown, Yakup Koc and Robert Kooij, Inflection Points for Network Reliability, Telecommunication Systems Journal, accepted for publication.

72.   Jason I. Brown, Karl Dilcher and Dante Manna, On a Sequence of Sparse Binomial Type Polynomials, Journal of Mathematical Analysis and Applications 398 (2013), 128-137.

71.   Jason I. Brown, Karl Dilcher and Dante Manna, Asymptotics  of a Sequence of Sparse Binomial-Type Polynomials, Analysis 32 (2012),  231-245.

70.   Jason I. Brown and Richard Hoshino, On Circulants Uniquely Characterized by their Independence Polynomials, Ars Combinatoria 104 (2012), 363-374.

69.   Jason I. Brown and Richard Hoshino, Line Graphs and Circulants, Ars Combinatoria 105 (2012), 463-476

68.   Jason I. Brown, Karl Dilcher and Dante Manna, Series Representations of Theta Functions in Terms of a Sequence of Polynomials, Fibonacci Quarterly,50 (2012), 5-10.

67.   Anthony Bonato, Jason I. Brown, Graeme Kemkes and Pawel Pralat, Independence and Chromatic Densities of Graphs, Journal of Combinatorics 2 (2011), 397-412.

66.   Jason I. Brown and Robert Dawson, Let Me Take It Down – The Mathematics Behind the Most Famous Edit in Rock ‘n’ Roll, Notes of the CMS 43 (2011), 16-17.

65.   Jason I. Brown and Richard Hoshino, Well-Covered Circulant Graphs, Discrete Mathematics 311 (2011), 244-251.

64.   Jason I. Brown, Erick Knight and David Wolfe, Party Parity with Picture Proofs: An Odd Checkerboard Problem, Mathematics Magazine 84 (2011), 142-149.

63. Jason I. Brown and Richard Hoshino, Proof of a Conjecture on Fractional Ramsey Numbers, Journal of Graph Theory 63 (2010), 164-178.

62. Jason I. Brown and Danielle Cox, The closure of the Set of Roots of Strongly Connected Reliability Polynomials is the Entire Complex Plane, Discrete Mathematics 309 (2009), 5043-5047.

61. Jason I. Brown and Karl Dilcher, On the Roots of Strongly Connected Reliability Polynomials, Networks 54 (2009), 108-116.

60. Jason I. Brown, Charles J. Colbourn and Richard Nowakowski, Chip Firing and All Terminal Reliability Bounds, Discrete Optimization 6 (2009), 436-445.

59.   Jason I. Brown and Bruce Sagan, Monomial Bases for Broken Circuit Complexes, Europe. J. Combin., European Journal of Combinatorics 30 (2009), 1786-1800.

58.   Jason I. Brown and Richard Hoshino, Independence Polynomials of Circulants with an Application to Music, Discrete Mathematics 309 (2009), 2292-2304.

57.   Jason I. Brown and Richard Hoshino, Nordhaus-Gaddum Inequalities for the Fractional and Circular Chromatic Numbers, Discrete Mathematics 309 (2009), 2223-2232.

56.  Jason I. Brown, Deducing the Blues, CMS Notes 41 (4) (2009), 13-15.

55.   Jason I. Brown and Richard Nowakowski, The Neighborhood Polynomial of a Graph, Australasian Journal of Combinatorics 42 (2008), 55-68.

54.  Jason I. Brown, Richard J. Nowakowski and Igor E. Zverovich, The Structure of Strongly C4-Free Well-Covered Graphs, Discrete Math. 307 (2007), 2235-2245.

53. Jason I. Brown and Richard Hoshino, The Ehrenfeucht-Fraisse Game for Paths and Cycles, Ars Combinatoria 8 (2007), 193-212.

52. Jason I. Brown and Xiaohu Li, Uniformly Optimal Digraphs for Strongly Connected Reliability, Networks 49 (2007), 145-151.

51.  Jason I. Brown and Richard J. Nowakowski, The Well-Covered Dimension of Random Graphs, Discrete Mathematics 307 (2007), 352-355.

50. Jason I. Brown and Richard J. Nowakowski, Well Covered Vector Spaces of Graphs, SIAM J. Discrete Math. 19 (2005), 952-965.

49.  Jason I. Brown, Carl A. Hickman, Hugh R. Thomas and David G. Wagner, Bounding the Roots of Ideal and Open Set Polynomials, Annals of Combinatorics 9 (2005), 259-268.

48. Jason I. Brown and Richard Nowakowski, Average Independence Polynomials, J. Comb. Th. B 93 (2005), 313-318.

47. Jason I. Brown and Xiaohu Li, The Strongly Connected Reliability of Complete Digraphs, Networks 45 (2005), 165-168.

46. Jason I. Brown, Carl A. Hickman and Richard J. Nowakowski, The k-Fractal of a Simplicial Complex, Discrete Mathematics 285 (2004), 33-45.

45.  Jason I. Brown, Carl A. Hickman and Richard J. Nowakowski, On the Location of Roots of Independence Polynomials, J. Algebraic Combinatorics 19 (2004), 273-282.

44.  Jason I. Brown, Mathematics, Physics and A Hard Day’s Night, CMS Notes 36 (2004), 4-8. [Translated in Swedish (Matematik, fysik och A Hard Day’ Night) and published in Beatles Nytt, 142 (2004), 22-25.]

43. Jason I. Brown, Carl A. Hickman and Richard J. Nowakowski, Independence Fractals of Graphs, J. Comb. Th. B. 87 (2003), 209-230.

42. Jason I. Brown and Carl A. Hickman, The Existence of Infinitely Many Chromatic Roots With Negative Real Part, Ars Combinatoria 63 (2002), 211-221.

41. Jason I. Brown and Carl A. Hickman, On Chromatic Roots of Large Subdivisions of Graphs, Discrete Mathematics 242 (2002), 17-30.

40. Jason I. Brown, Carl A. Hickman, Alan D. Sokal and David G. Wagner, Chromatic Roots of Generalized Theta Graphs, J. Comb. Th. B 83 (2001), 272-297.

39. Jason I. Brown and Richard J. Nowakowski, Bounding the Roots of Independence Polynomials, Ars Combinatoria 58 (2001), 113-120.

38. Jason I. Brown, K. Dilcher and Richard J. Nowakowski, Roots of Independence Polynomials of Well Covered Graphs, J. Algebraic Comb. 11 (2000), 197-210.

37. Jason I. Brown, Subdivisions and Chromatic Roots, J. Combin. Th. B 76 (1999), 201-204.

36. Jason I. Brown, Chromatic Polynomials and Order Ideals of Monomials, Discrete Mathematics 189 (1998), 43-68.

35. Jason I. Brown, On the Roots of Chromatic Polynomials, J. Combin. Th. B 72 (1998), 251-256.

34. D. Achlioptas, J.I. Brown, D.G. Corneil and M.S.O. Molloy, The Existence of Uniquely -G Colourable Graphs, Discrete Mathematics 179 (1998), 1-11.

33. Jason I. Brown, Charles J. Colbourn and David G. Wagner, Cohen-Macaulay Rings in Network Reliability, SIAM J. Discrete Math. 9 (1996), 377-392.

32. Jason I. Brown and Stephen Watson, The Number of Complements of a Topology on n points is 2^n (except for some special cases), Discrete Mathematics 154 (1996), 1-25.

31. Jason I. Brown, Richard J. Nowakowski and Douglas Rall, The Ultimate Categorical Independence Ratio, SIAM J. Discrete Math. 9 (1996), 290-300.

3-.  Jason I. Brown, The Complexity of Generalized Graph Colourings, Discrete Appl. Math. 69 (1996), 245-253.

29. Jason I. Brown and Charles J. Colbourn, Non-Stanley Bounds for Network Reliability, Journal of Algebraic Combinatorics 5 (1996), 13-36.

28. Jason I. Brown and Charles J. Colbourn, On the Log Concavity of Reliability and Matroidal Sequences, Advances in Applied Mathematics 15 (1994), 114-127.

27. Jason I. Brown and A. Sidorenko, The Inducibility of Complete Bipartite Graphs, J. Graph Theory 18 (1994), 629-645.

26. Jason I. Brown and Stephen Watson, Partial Order Complementation Graphs, Order 11 (1994), 237-255.

25. Jason I. Brown and Vojtech Rödl, Folkman Numbers for Graphs of Small Order, Ars Combinatoria 35-A (1993), 11-27.

24. Jason I. Brown and Stephen Watson, Mutually Complementary Partial Orders, Discrete Mathematics 113 (1993), 27-39.

23. Jason I. Brown, Charles J. Colbourn and John S. Devitt, Network Transformations and Bounding Network Reliability, Networks 23 (1993), 1-17.

22. Jason I. Brown and Charles J. Colbourn, Roots of the Reliability Polynomial, SIAM J. Discrete Math. 5 (1992), 571-585.

21. Jason I. Brown and Derek G. Corneil, On Uniquely -G k-Colourable Graphs, Quaestiones Math. 15 (1992), 477-487.

20. Jason I. Brown, A Vertex Critical Graph Without Critical Edges, Discrete Math. 102 (1992), 99-101.

19. Jason I. Brown and Derek G. Corneil, Graph Properties and Hypergraph Colourings, Discrete Math. 98 (1991), 81-93.

18. Jason I. Brown and Stephen Watson, Self Complementary Topologies and Partial Orders, Order 7 (1991), 317-328.

17. Jason I. Brown and Vojtech Rödl, A Ramsey Type Problem Concerning Vertex Colourings, J. Combin. Th. B 52 (1991), 45-52.

16. Jason I. Brown and Derek Corneil, Perfect Colourings, Ars. Combinatoria 30 (1990), 141-159.

15. Gerhard Benadé, Izak Broere and Jason I. Brown, A Construction of Uniquely -C4 Colourable Graphs,  Quaestiones Math. 13 (1990), 359-364.

14. Jason I. Brown, Derek G. Corneil and A.R. Mahjoub, A Note on Ki-Perfection, J. Graph Th. 14 (1990), 333-340.

13. Jason I. Brown and Vojtech Rödl, A New Construction of k-Folkman Graphs, Ars Combinatoria 29 (1990), 265-269.

12. Jason I. Brown, David Kelly, J. Schönheim and Robert E. Woodrow, Graph Colouring Satisfying Restraints, Discrete Math. 80 (1990), 123-143.

11. Jason I. Brown and Charles J. Colbourn, A Set System Polynomial with Coloring and Reliability Applications, SIAM J. Disc. Math. 1 (1988), 151-157.

10.  Jason I. Brown and Derek G. Corneil, On Generalized Graph Colorings, J. Graph Th. 11 (1987), 87-99.

9.    Jason I. Brown and Charles J. Colbourn, A Combinatorial Study of the Reliability Polynomial, Congressus Numeratium 56 (1987), 71 - 89.

Nonrefereed Publications

8.    Jason I. Brown, Algebraic and Analytic Properties of Network Reliability, Notes of the CMS 43 (2011), 14-17.

7.    Jason I. Brown, The Mathematics of John’s Left Hand, Guitar Player Magazine (March 2009), 19.

6.    Jason I. Brown, The Half-Speed Mystery of “A Hard Day’s Night”, Guitar Player Magazine (November 2006), 127.

5.    Jason I. Brown, A Hard Day’s Mystery, Guitar Player Magazine (January 2005), 34.

4.    Jason I. Brown, Maple Roots Itself in High Schools, Computer Dealer News 11 (Jan. 25, 1995), 28-30.

3.    Jason I. Brown, Tips on Designing Multimedia Program Menus, Multimedia Today 3 (1995), 50-51.

2.    Jason I. Brown, Lost in Hyperspace, Multimedia Today 2 (1994), 40-42.

1.    Jason I. Brown, Maple V Project: Final Report, Technical Report 94-2, Center for the Study of Computers in Education, York University, 1994 (submitted to the Province of Ontario's Ministry of Education and Training).

Refereed Conference Papers

C2.  Jason I. Brown, Yakup Koc and Robert Kooij, Reliability Polynomials Crossing More than Twice, in: Proceedings of the 2011 International Workshop on Reliable Network Design and Modeling (RNDM'11), pages 1-6, 2011

C1.  Jason I. Brown and Charles J. Colbourn, A Combinatorial Study of the Reliability Polynomial, presented at the Proc. Sixteenth Manitoba Conf. Numerical Mathematics and Computing, Winnipeg, Manitoba, Canada (1986), 71-89.

Research Monograph/Graduate Texts

M1. Jason I. Brown, Discrete Structures and Their Applications, CRC Press, to be published.

Undergraduate Texts

U1. F. Venit, W. Bishop and J.I. Brown, Elementary Linear Algebra (Second Canadian Edition), Nelson, 2012.

U1. F. Venit, W. Bishop and J.I. Brown, Elementary Linear Algebra (First Canadian Edition), Nelson, 2008.

Nonfiction

N1. Jason I. Brown, Our Days Are Numbered, McClelland & Stewart, 2009.

N2. Jason I. Brown, Our Days Are Numbered (Japanese edition), Hayakawa Publishing, 2010.