default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJason I. Brown
Person information
- affiliation: Dalhousie University, Department of Mathematics and Statistics, Halifax, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j79]Jason I. Brown
, Isaac McMullin:
On the split reliability of graphs. Networks 82(2): 177-185 (2023)- [i2]Jason I. Brown, Ian George:
Modulation Graphs in Popular Music. CoRR abs/2306.13691 (2023) - 2022
- [j78]Jason I. Brown:
Maximal intervals of decrease and inflection points for node reliability. Discret. Appl. Math. 313: 40-44 (2022) - [j77]Iain Beaton, Jason I. Brown:
On the Unimodality of Domination Polynomials. Graphs Comb. 38(3): 90 (2022) - 2021
- [j76]Jason I. Brown, Iain Beaton:
On the real roots of domination polynomials. Contributions Discret. Math. 16(3): 175-182 (2021) - [j75]Iain Beaton, Jason I. Brown:
The average order of dominating sets of a graph. Discret. Math. 344(12): 112595 (2021) - [j74]Jason I. Brown, Charles J. Colbourn, Danielle Cox, Christina Graves, Lucas Mol:
Network reliability: Heading out on the highway. Networks 77(1): 146-160 (2021) - [j73]Jason I. Brown, Corey D. C. DeGagné:
Roots of two-terminal reliability polynomials. Networks 78(2): 153-163 (2021) - 2020
- [j72]Jason I. Brown, Ben Cameron:
A note on purely imaginary independence roots. Discret. Math. 343(12): 112113 (2020) - [j71]Jason I. Brown, Lucas Mol:
On the roots of the subtree polynomial. Eur. J. Comb. 89: 103181 (2020) - [j70]Jason I. Brown, Ben Cameron:
Maximum Modulus of Independence Roots of Graphs and Trees. Graphs Comb. 36(3): 877-894 (2020) - [j69]Iain Beaton, Jason I. Brown, Danielle Cox:
Optimal Domination Polynomials. Graphs Comb. 36(5): 1477-1487 (2020) - [j68]Jason I. Brown, David G. Wagner:
On the imaginary parts of chromatic roots. J. Graph Theory 93(2): 299-311 (2020) - [j67]Jason I. Brown, Corey D. C. DeGagné:
Rational roots of all-terminal reliability. Networks 76(1): 75-83 (2020)
2010 – 2019
- 2019
- [j66]Iain Beaton, Jason I. Brown:
The domination equivalence classes of paths. Australas. J Comb. 73: 291-312 (2019) - [j65]Iain Beaton, Jason I. Brown, Ben Cameron:
Independence equivalence classes of paths and cycles. Australas. J Comb. 75: 127-145 (2019) - [j64]Jason I. Brown, Corey D. C. DeGagné:
On the reliability roots of simplicial complexes and matroids. Discret. Math. 342(8): 2356-2370 (2019) - [i1]Mark E. Glickman, Jason I. Brown, Ryan B. Song:
(A) Data in the Life: Authorship Attribution of Lennon-McCartney Songs. CoRR abs/1906.05427 (2019) - 2018
- [j63]Jason I. Brown, Ben Cameron:
On the Stability of Independence Polynomials. Electron. J. Comb. 25(1): 1 (2018) - [j62]Jason I. Brown, Lucas Mol:
The shape of node reliability. Discret. Appl. Math. 238: 41-55 (2018) - [j61]Jason I. Brown, Ben Cameron:
On the unimodality of independence polynomials of very well-covered graphs. Discret. Math. 341(4): 1138-1143 (2018) - [j60]Jason I. Brown, Lucas Mol, Ortrud R. Oellermann:
On the roots of Wiener polynomials of graphs. Discret. Math. 341(9): 2398-2408 (2018) - [j59]Jason I. Brown, Danielle Cox:
Optimal Graphs for Independence and k-Independence Polynomials. Graphs Comb. 34(6): 1445-1457 (2018) - 2017
- [j58]Jason I. Brown, Aysel Erey:
Restraints permitting the largest number of colourings. Discret. Appl. Math. 222: 76-88 (2017) - [j57]Jason I. Brown, Lucas Mol:
On the roots of all-terminal reliability polynomials. Discret. Math. 340(6): 1287-1299 (2017) - 2016
- [j56]Jason I. Brown, Aysel Erey:
On the Real Roots of σ -Polynomials. Graphs Comb. 32(5): 1723-1730 (2016) - [j55]Jason I. Brown, Aysel Erey:
On the Roots of σ-Polynomials. J. Graph Theory 82(1): 90-102 (2016) - [j54]Jason I. Brown, Danielle Cox:
Inflection points of reliability polynomials are dense in [0, 1]. Networks 67(4): 266-269 (2016) - [j53]Jason I. Brown, Lucas Mol:
On the roots of the node reliability polynomial. Networks 68(3): 238-246 (2016) - 2015
- [j52]Jason I. Brown, Ortrud R. Oellermann:
On the spectrum and number of convex sets in graphs. Discret. Math. 338(7): 1144-1153 (2015) - [j51]Jason I. Brown, Aysel Erey:
New bounds for chromatic polynomials and chromatic roots. Discret. Math. 338(11): 1938-1946 (2015) - 2014
- [j50]Jason I. Brown, Danielle Cox, Richard Ehrenborg:
The average reliability of a graph. Discret. Appl. Math. 177: 19-33 (2014) - [j49]Jason I. Brown, Aysel Erey:
A note on the real part of complex chromatic roots. Discret. Math. 328: 96-101 (2014) - [j48]Anthony Bonato, Jason I. Brown, Dieter Mitsche, Pawel Pralat:
Independence densities of hypergraphs. Eur. J. Comb. 40: 124-136 (2014) - [j47]Jason I. Brown, Julia Tufts:
On the Roots of Domination Polynomials. Graphs Comb. 30(3): 527-547 (2014) - [j46]Jason I. Brown, Ortrud R. Oellermann:
Graphs with a Minimal Number of Convex Sets. Graphs Comb. 30(6): 1383-1397 (2014) - [j45]Jason I. Brown, Danielle Cox:
Nonexistence of optimal graphs for all terminal reliability. Networks 63(2): 146-153 (2014) - [j44]Jason I. Brown, Yakup Koç, Robert E. Kooij:
Inflection points for network reliability. Telecommun. Syst. 56(1): 79-84 (2014) - 2013
- [j43]Jason I. Brown, Karl Dilcher, Dante V. Manna:
On the Roots of Expected Independence Polynomials. J. Graph Theory 73(3): 322-326 (2013) - 2012
- [j42]Jason I. Brown, Richard Hoshino:
On Circulants Uniquely Characterized by their Independence Polynomials. Ars Comb. 104: 363-374 (2012) - [j41]Jason I. Brown, Richard Hoshino:
Line Graphs and Circulants. Ars Comb. 105: 463-476 (2012) - 2011
- [j40]Jason I. Brown, Richard Hoshino:
Well-covered circulant graphs. Discret. Math. 311(4): 244-251 (2011) - [c1]Jason I. Brown, Yakup Koc, Robert E. Kooij:
Reliability polynomials crossing more than twice. ICUMT 2011: 1-6 - 2010
- [j39]Jason I. Brown, Richard Hoshino:
Proof of a conjecture on fractional Ramsey numbers. J. Graph Theory 63(2): 164-178 (2010)
2000 – 2009
- 2009
- [j38]Jason I. Brown, Charles J. Colbourn, Richard J. Nowakowski:
Chip firing and all-terminal network reliability bounds. Discret. Optim. 6(4): 436-445 (2009) - [j37]Jason I. Brown, R. Hoshino:
Nordhaus-Gaddum inequalities for the fractional and circular chromatic numbers. Discret. Math. 309(8): 2223-2232 (2009) - [j36]Jason I. Brown, Richard Hoshino:
Independence polynomials of circulants with an application to music. Discret. Math. 309(8): 2292-2304 (2009) - [j35]Jason I. Brown, Danielle Cox:
The closure of the set of roots of strongly connected reliability polynomials is the entire complex plane. Discret. Math. 309(16): 5043-5047 (2009) - [j34]Jason I. Brown, Bruce E. Sagan:
Monomial bases for broken circuit complexes. Eur. J. Comb. 30(8): 1786-1800 (2009) - [j33]Jason I. Brown, Karl Dilcher:
On the roots of strongly connected reliability polynomials. Networks 54(2): 108-116 (2009) - 2008
- [j32]Jason I. Brown, Richard J. Nowakowski:
The neighbourhood polynomial of a graph. Australas. J Comb. 42: 55-68 (2008) - 2007
- [j31]Jason I. Brown, Richard Hoshino:
The Ehrenfeucht-Fraisse Game for Paths and Cycles. Ars Comb. 83 (2007) - [j30]Jason I. Brown, Richard J. Nowakowski:
The well-covered dimension of random graphs. Discret. Math. 307(3-5): 352-355 (2007) - [j29]Jason I. Brown, Richard J. Nowakowski, Igor E. Zverovich:
The structure of well-covered graphs with no cycles of length 4. Discret. Math. 307(17-18): 2235-2245 (2007) - [j28]Jason I. Brown, Xiaohu Li:
Uniformly optimal digraphs for strongly connected reliability. Networks 49(2): 145-151 (2007) - 2005
- [j27]Jason I. Brown, Richard J. Nowakowski:
Average independence polynomials. J. Comb. Theory B 93(2): 313-318 (2005) - [j26]Jason I. Brown, Xiaohu Li:
The strongly connected reliability of complete digraphs. Networks 45(3): 165-168 (2005) - [j25]Jason I. Brown, Richard J. Nowakowski:
Well-Covered Vector Spaces of Graphs. SIAM J. Discret. Math. 19(4): 952-965 (2005) - 2004
- [j24]Jason I. Brown, Carl A. Hickman, Richard J. Nowakowski:
The k-fractal of a simplicial complex. Discret. Math. 285(1-3): 33-45 (2004) - 2003
- [j23]Jason I. Brown, Carl A. Hickman, Richard J. Nowakowski:
The independence fractal of a graph. J. Comb. Theory B 87(2): 209-230 (2003) - 2002
- [j22]Jason I. Brown, Carl A. Hickman:
On chromatic roots with negative real part. Ars Comb. 63 (2002) - [j21]Jason I. Brown, Carl A. Hickman:
On chromatic roots of large subdivisions of graphs. Discret. Math. 242(1-3): 17-30 (2002) - 2001
- [j20]Jason I. Brown, Richard J. Nowakowski:
Bounding the Roots of Independence Polynomials. Ars Comb. 58 (2001) - [j19]Jason I. Brown, Carl A. Hickman, Alan D. Sokal, David G. Wagner:
On the Chromatic Roots of Generalized Theta Graphs. J. Comb. Theory B 83(2): 272-297 (2001)
1990 – 1999
- 1999
- [j18]Jason I. Brown:
Subdivisions and Chromatic Roots. J. Comb. Theory B 76(2): 201-204 (1999) - 1998
- [j17]Dimitris Achlioptas, Jason I. Brown, Derek G. Corneil, Michael Molloy:
The existence of uniquely -G colourable graphs. Discret. Math. 179(1-3): 1-11 (1998) - [j16]Jason I. Brown:
Chromatic polynomials and order ideals of monomials. Discret. Math. 189(1-3): 43-68 (1998) - [j15]Jason I. Brown:
On the Roots of Chromatic Polynomials. J. Comb. Theory B 72(2): 251-256 (1998) - 1996
- [j14]Jason I. Brown:
The Complexity of Generalized Graph Colorings. Discret. Appl. Math. 69(3): 257-270 (1996) - [j13]Jason I. Brown, Stephen Watson:
The number of complements of a topology on n points is at least 2n (except for some special cases). Discret. Math. 154(1-3): 27-39 (1996) - [j12]Jason I. Brown, Richard J. Nowakowski, Douglas F. Rall:
The Ultimate Categorical Independence Ratio of a Graph. SIAM J. Discret. Math. 9(2): 290-300 (1996) - [j11]Jason I. Brown, Charles J. Colbourn, David G. Wagner:
Cohen-Macaulay Rings in Network Reliability. SIAM J. Discret. Math. 9(3): 377-392 (1996) - 1993
- [j10]Jason I. Brown, Stephen Watson:
Mutually complementary partial orders. Discret. Math. 113(1-3): 27-39 (1993) - [j9]Jason I. Brown, Charles J. Colbourn, John S. Devitt:
Network transformations and bounding network reliability. Networks 23(1): 1-17 (1993) - 1992
- [j8]Jason I. Brown:
A vertex critical graph without critical edges. Discret. Math. 102(1): 99-101 (1992) - [j7]Jason I. Brown, Charles J. Colbourn:
Roots of the Reliability Polynomial. SIAM J. Discret. Math. 5(4): 571-585 (1992) - 1991
- [j6]Jason I. Brown, Derek G. Corneil:
Graph properties and hypergraph colourings. Discret. Math. 98(2): 81-93 (1991) - [j5]Jason I. Brown, Vojtech Rödl:
A ramsey type problem concerning vertex colourings. J. Comb. Theory B 52(1): 45-52 (1991) - 1990
- [j4]Jason I. Brown, David Kelly, Johanan Schönheim, Robert E. Woodrow:
Graph coloring satisfying restraints. Discret. Math. 80(2): 123-143 (1990) - [j3]Jason I. Brown, Derek G. Corneil, Ali Ridha Mahjoub:
A note on Ki-perfect graphs. J. Graph Theory 14(3): 333-340 (1990)
1980 – 1989
- 1988
- [j2]Jason I. Brown, Charles J. Colbourn:
A Set System Polynomial with Colouring and Reliability Applications. SIAM J. Discret. Math. 1(2): 151-157 (1988) - 1987
- [j1]Jason I. Brown, Derek G. Corneil:
On generalized graph colorings. J. Graph Theory 11(1): 87-99 (1987)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:17 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
