Jason Brown

Cited by

	All	Since 2020
Citations	2008	687
h-index	25	13
i10-index	57	24

160

120

1990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202420256 6 16 9 11 13 31 26 35 11 26 24 18 30 44 57 33 37 42 55 31 59 50 72 96 68 99 82 100 86 144 109 151 147 111 24

Public access

View all

21 articles

4 articles

available

not available

Based on funding mandates

Co-authors

Richard NowakowskiProfessor Emeritus, Mathematics, Dalhousie University, Nova Scotia, CanadaVerified email at dal.ca
Robert KooijProfessor TU Delft & Senior Scientist TNOVerified email at tudelft.nl
Alan D. SokalProfessor of Physics, New York University; Professor of Mathematics, University College LondonVerified email at nyu.edu
Yakup KoçStedin & Delft University of TechnologyVerified email at tudelft.nl
Michael MolloyUniversity of TorontoVerified email at cs.toronto.edu
Saeid AlikhaniProfessor of Mathematics, Yazd UniversityVerified email at yazd.ac.ir
Douglas F. RallFurman UniversityVerified email at furman.edu
Richard EhrenborgProfessor of Mathematics, University of KentuckyVerified email at uky.edu
Anthony BonatoProfessor of Mathematics, Toronto Metropolitan UniversityVerified email at torontomu.ca
Izak BroereProfessor of Mathematics, University of PretoriaVerified email at up.ac.za
Bruce SaganVerified email at math.msu.edu
Hugh ThomasProfessor of Mathematics, UQAMVerified email at uqam.ca
A. Ridha MahjoubProfessor of Operations Research, Université Paris-DauphineVerified email at lamsade.dauphine.fr
David WolfeProfessor, Cornell UniversityVerified email at cornell.edu

Jason Brown

Professor of Mathematics and Statistisc, Dalhousie University

Verified email at mathstat.dal.ca

graph theory combinatorics mathematics and music


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
Roots of independence polynomials of well covered graphs JI Brown, K Dilcher, RJ Nowakowski Journal of Algebraic Combinatorics 11, 197-210, 2000	115	2000
On the location of roots of independence polynomials JI Brown, CA Hickman, RJ Nowakowski Journal of Algebraic Combinatorics 19, 273-282, 2004	112	2004
Roots of the reliability polynomials JI Brown, CJ Colbourn SIAM Journal on Discrete Mathematics 5 (4), 571-585, 1992	102	1992
On generalized graph colorings JI Brown, DG Corneil Journal of Graph Theory 11 (1), 87-99, 1987	77	1987
Bounding the roots of independence polynomials JI Brown, RJ Nowakowski Ars Combinatoria 58, 113-120, 2001	62	2001
On the roots of domination polynomials JI Brown, J Tufts Graphs and Combinatorics 30 (3), 527-547, 2014	58	2014
The inducibility of complete bipartite graphs JI Brown, A Sidorenko Journal of Graph Theory 18 (6), 629-645, 1994	58	1994
On the chromatic roots of generalized theta graphs JI Brown, C Hickman, AD Sokal, DG Wagner Journal of Combinatorial Theory, Series B 83 (2), 272-297, 2001	57	2001
Network transformations and bounding network reliability JI Brown, CJ Colbourn, JS Devitt Networks 23 (1), 1-17, 1993	53	1993
On chromatic roots of large subdivisions of graphs JI Brown, CA Hickman Discrete mathematics 242 (1-3), 17-30, 2002	46	2002
The complexity of generalized graph colorings JI Brown Discrete Applied Mathematics 69 (3), 257-270, 1996	43	1996
The neighbourhood polynomial of a graph. JI Brown, RJ Nowakowski Australas. J Comb. 42, 55-68, 2008	42	2008
Average independence polynomials JI Brown, RJ Nowakowski Journal of Combinatorial Theory, Series B 93 (2), 313-318, 2005	42	2005
The independence fractal of a graph JI Brown, CA Hickman, RJ Nowakowski Journal of Combinatorial Theory, Series B 87 (2), 209-230, 2003	39	2003
Independence polynomials of circulants with an application to music J Brown, R Hoshino Discrete Mathematics 309 (8), 2292-2304, 2009	38	2009
Network reliability: Heading out on the highway JI Brown, CJ Colbourn, D Cox, C Graves, L Mol Networks 77 (1), 146-160, 2021	37	2021
On the roots of all-terminal reliability polynomials J Brown, L Mol Discrete Mathematics 340 (6), 1287-1299, 2017	36	2017
Well-covered circulant graphs J Brown, R Hoshino Discrete Mathematics 311 (4), 244-251, 2011	36	2011
Nonexistence of optimal graphs for all terminal reliability JI Brown, D Cox Networks 63 (2), 146-153, 2014	35	2014
On the domination polynomials of friendship graphs S Alikhani, JI Brown, S Jahari Filomat 30 (1), 169-178, 2016	32	2016

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors