New approximations for network reliability.

Jason I. Brown Dalhousie University, Department of Mathematics and Statistics, Halifax, Canada https://zbmath.org/authors/?q=ai:brown.jason-i https://orcid.org/0000-0002-4721-8985

Jason I. Brown Theodore Kolokolnikov Robert E. Kooij New approximations for network reliability. 51-63 2024 84 Networks 1 https://doi.org/10.1002/net.22215 db/journals/networks/networks84.html#BrownKK24

Jason I. Brown Isaac McMullin On the split reliability of graphs. 177-185 2023 September 82 Networks 2 https://doi.org/10.1002/net.22166 db/journals/networks/networks82.html#BrownM23

Jason I. Brown Ian George Modulation Graphs in Popular Music. 2023 abs/2306.13691 CoRR https://doi.org/10.48550/arXiv.2306.13691 db/journals/corr/corr2306.html#abs-2306-13691

Jason I. Brown Maximal intervals of decrease and inflection points for node reliability. 40-44 2022 313 Discret. Appl. Math. https://doi.org/10.1016/j.dam.2022.02.002 db/journals/dam/dam313.html#Brown22

Iain Beaton Jason I. Brown On the Unimodality of Domination Polynomials. 90 2022 38 Graphs Comb. 3 https://doi.org/10.1007/s00373-022-02487-x db/journals/gc/gc38.html#BeatonB22

Jason I. Brown Iain Beaton On the real roots of domination polynomials. 175-182 2021 16 Contributions Discret. Math. 3 https://doi.org/10.11575/cdm.v16i3.72075 https://doi.org/10.55016/ojs/cdm.v16i3.72075 db/journals/cdm/cdm16.html#BrownB21

Iain Beaton Jason I. Brown The average order of dominating sets of a graph. 112595 2021 344 Discret. Math. 12 https://doi.org/10.1016/j.disc.2021.112595 db/journals/dm/dm344.html#BeatonB21

Jason I. Brown Charles J. Colbourn Danielle Cox Christina Graves 0001 Lucas Mol Network reliability: Heading out on the highway. 146-160 2021 77 Networks 1 https://doi.org/10.1002/net.21977 db/journals/networks/networks77.html#BrownCCGM21

Jason I. Brown Corey D. C. DeGagné Roots of two-terminal reliability polynomials. 153-163 2021 78 Networks 2 https://doi.org/10.1002/net.22004 db/journals/networks/networks78.html#BrownD21

Jason I. Brown Ben Cameron A note on purely imaginary independence roots. 112113 2020 343 Discret. Math. 12 https://doi.org/10.1016/j.disc.2020.112113 db/journals/dm/dm343.html#BrownC20

Jason I. Brown Lucas Mol On the roots of the subtree polynomial. 103181 2020 89 Eur. J. Comb. https://doi.org/10.1016/j.ejc.2020.103181 db/journals/ejc/ejc89.html#BrownM20

Jason I. Brown Ben Cameron Maximum Modulus of Independence Roots of Graphs and Trees. 877-894 2020 36 Graphs Comb. 3 https://doi.org/10.1007/s00373-020-02160-1 db/journals/gc/gc36.html#BrownC20

Iain Beaton Jason I. Brown Danielle Cox Optimal Domination Polynomials. 1477-1487 2020 36 Graphs Comb. 5 https://doi.org/10.1007/s00373-020-02202-8 db/journals/gc/gc36.html#BeatonBC20

Jason I. Brown David G. Wagner On the imaginary parts of chromatic roots. 299-311 2020 93 J. Graph Theory 2 https://doi.org/10.1002/jgt.22487 https://www.wikidata.org/entity/Q127408365 db/journals/jgt/jgt93.html#BrownW20

Jason I. Brown Corey D. C. DeGagné Rational roots of all-terminal reliability. 75-83 2020 76 Networks 1 https://doi.org/10.1002/net.21938 db/journals/networks/networks76.html#BrownD20

Iain Beaton Jason I. Brown The domination equivalence classes of paths. 291-312 2019 73 Australas. J Comb. http://ajc.maths.uq.edu.au/pdf/73/ajc_v73_p291.pdf db/journals/ajc/ajc73.html#BeatonB19

Iain Beaton Jason I. Brown Ben Cameron Independence equivalence classes of paths and cycles. 127-145 2019 75 Australas. J Comb. http://ajc.maths.uq.edu.au/pdf/75/ajc_v75_p127.pdf db/journals/ajc/ajc75.html#BeatonBC19

Jason I. Brown Corey D. C. DeGagné On the reliability roots of simplicial complexes and matroids. 2356-2370 2019 342 Discret. Math. 8 https://doi.org/10.1016/j.disc.2019.05.002 https://www.wikidata.org/entity/Q127823710 db/journals/dm/dm342.html#BrownD19

Mark E. Glickman Jason I. Brown Ryan B. Song (A) Data in the Life: Authorship Attribution of Lennon-McCartney Songs. 2019 abs/1906.05427 CoRR http://arxiv.org/abs/1906.05427 db/journals/corr/corr1906.html#abs-1906-05427

Jason I. Brown Ben Cameron On the Stability of Independence Polynomials. 1 2018 25 Electron. J. Comb. 1 https://doi.org/10.37236/7280 db/journals/combinatorics/combinatorics25.html#BrownC18

Jason I. Brown Lucas Mol The shape of node reliability. 41-55 2018 238 Discret. Appl. Math. https://doi.org/10.1016/j.dam.2017.11.035 db/journals/dam/dam238.html#BrownM18

Jason I. Brown Ben Cameron On the unimodality of independence polynomials of very well-covered graphs. 1138-1143 2018 341 Discret. Math. 4 https://doi.org/10.1016/j.disc.2017.10.007 db/journals/dm/dm341.html#BrownC18

Jason I. Brown Lucas Mol Ortrud R. Oellermann On the roots of Wiener polynomials of graphs. 2398-2408 2018 341 Discret. Math. 9 https://doi.org/10.1016/j.disc.2018.05.014 db/journals/dm/dm341.html#BrownMO18

Jason I. Brown Danielle Cox Optimal Graphs for Independence and k-Independence Polynomials. 1445-1457 2018 34 Graphs Comb. 6 https://doi.org/10.1007/s00373-018-1946-0 https://www.wikidata.org/entity/Q129293306 db/journals/gc/gc34.html#BrownC18

Jason I. Brown Aysel Erey Restraints permitting the largest number of colourings. 76-88 2017 222 Discret. Appl. Math. https://doi.org/10.1016/j.dam.2017.01.022 db/journals/dam/dam222.html#BrownE17

Jason I. Brown Lucas Mol On the roots of all-terminal reliability polynomials. 1287-1299 2017 340 Discret. Math. 6 https://doi.org/10.1016/j.disc.2017.01.024 db/journals/dm/dm340.html#BrownM17

Jason I. Brown Aysel Erey On the Real Roots of σ -Polynomials. 1723-1730 2016 32 Graphs Comb. 5 https://doi.org/10.1007/s00373-016-1684-0 db/journals/gc/gc32.html#BrownE16

Jason I. Brown Aysel Erey On the Roots of σ-Polynomials. 90-102 2016 82 J. Graph Theory 1 https://doi.org/10.1002/jgt.21889 db/journals/jgt/jgt82.html#BrownE16

Jason I. Brown Danielle Cox Inflection points of reliability polynomials are dense in [0, 1]. 266-269 2016 67 Networks 4 https://doi.org/10.1002/net.21669 db/journals/networks/networks67.html#BrownC16

Jason I. Brown Lucas Mol On the roots of the node reliability polynomial. 238-246 2016 68 Networks 3 https://doi.org/10.1002/net.21697 db/journals/networks/networks68.html#BrownM16

Jason I. Brown Ortrud R. Oellermann On the spectrum and number of convex sets in graphs. 1144-1153 2015 338 Discret. Math. 7 https://doi.org/10.1016/j.disc.2015.01.024 db/journals/dm/dm338.html#BrownO15

Jason I. Brown Aysel Erey New bounds for chromatic polynomials and chromatic roots. 1938-1946 2015 338 Discret. Math. 11 https://doi.org/10.1016/j.disc.2015.04.021 db/journals/dm/dm338.html#BrownE15

Jason I. Brown Danielle Cox Richard Ehrenborg The average reliability of a graph. 19-33 2014 177 Discret. Appl. Math. https://doi.org/10.1016/j.dam.2014.05.048 db/journals/dam/dam177.html#BrownCE14

Jason I. Brown Aysel Erey A note on the real part of complex chromatic roots. 96-101 2014 328 Discret. Math. https://doi.org/10.1016/j.disc.2014.04.007 db/journals/dm/dm328.html#BrownE14

Anthony Bonato Jason I. Brown Dieter Mitsche Pawel Pralat Independence densities of hypergraphs. 124-136 2014 40 Eur. J. Comb. https://doi.org/10.1016/j.ejc.2014.03.001 db/journals/ejc/ejc40.html#BonatoBMP14

Jason I. Brown Julia Tufts On the Roots of Domination Polynomials. 527-547 2014 30 Graphs Comb. 3 https://doi.org/10.1007/s00373-013-1306-z db/journals/gc/gc30.html#BrownT14

Jason I. Brown Ortrud R. Oellermann Graphs with a Minimal Number of Convex Sets. 1383-1397 2014 30 Graphs Comb. 6 https://doi.org/10.1007/s00373-013-1356-2 db/journals/gc/gc30.html#BrownO14

Jason I. Brown Danielle Cox Nonexistence of optimal graphs for all terminal reliability. 146-153 2014 63 Networks 2 https://doi.org/10.1002/net.21530 db/journals/networks/networks63.html#BrownC14

Jason I. Brown Yakup Koç Robert E. Kooij Inflection points for network reliability. 79-84 2014 56 Telecommun. Syst. 1 https://doi.org/10.1007/s11235-013-9820-0 db/journals/telsys/telsys56.html#BrownKK14

Jason I. Brown Karl Dilcher Dante V. Manna On the Roots of Expected Independence Polynomials. 322-326 2013 73 J. Graph Theory 3 https://doi.org/10.1002/jgt.21678 db/journals/jgt/jgt73.html#BrownDM13

Jason I. Brown Richard Hoshino On Circulants Uniquely Characterized by their Independence Polynomials. 363-374 2012 104 Ars Comb. db/journals/arscom/arscom104.html#BrownH12

Jason I. Brown Richard Hoshino Line Graphs and Circulants. 463-476 2012 105 Ars Comb. db/journals/arscom/arscom105.html#BrownH12a

Jason I. Brown Richard Hoshino Well-covered circulant graphs. 244-251 2011 311 Discret. Math. 4 https://doi.org/10.1016/j.disc.2010.11.007 db/journals/dm/dm311.html#BrownH11

Jason I. Brown Yakup Koc Robert E. Kooij Reliability polynomials crossing more than twice. 1-6 2011 ICUMT https://ieeexplore.ieee.org/document/6078860/ conf/icumt/2011 db/conf/icumt/icumt2011.html#BrownKK11

Jason I. Brown Richard Hoshino Proof of a conjecture on fractional Ramsey numbers. 164-178 2010 63 J. Graph Theory 2 https://doi.org/10.1002/jgt.20416 https://www.wikidata.org/entity/Q123016745 db/journals/jgt/jgt63.html#BrownH10

Jason I. Brown Charles J. Colbourn Richard J. Nowakowski Chip firing and all-terminal network reliability bounds. 436-445 2009 6 Discret. Optim. 4 https://doi.org/10.1016/j.disopt.2009.05.003 db/journals/disopt/disopt6.html#BrownCN09

Jason I. Brown R. Hoshino Nordhaus-Gaddum inequalities for the fractional and circular chromatic numbers. 2223-2232 2009 309 Discret. Math. 8 https://doi.org/10.1016/j.disc.2008.04.052 db/journals/dm/dm309.html#BrownH09

Jason I. Brown Richard Hoshino Independence polynomials of circulants with an application to music. 2292-2304 2009 309 Discret. Math. 8 https://doi.org/10.1016/j.disc.2008.05.003 db/journals/dm/dm309.html#BrownH09a

Jason I. Brown Danielle Cox The closure of the set of roots of strongly connected reliability polynomials is the entire complex plane. 5043-5047 2009 309 Discret. Math. 16 https://doi.org/10.1016/j.disc.2009.03.012 db/journals/dm/dm309.html#BrownC09

Jason I. Brown Bruce E. Sagan Monomial bases for broken circuit complexes. 1786-1800 2009 30 Eur. J. Comb. 8 https://doi.org/10.1016/j.ejc.2008.12.009 db/journals/ejc/ejc30.html#BrownS09

Jason I. Brown Karl Dilcher On the roots of strongly connected reliability polynomials. 108-116 2009 54 Networks 2 https://doi.org/10.1002/net.20301 db/journals/networks/networks54.html#BrownD09

Jason I. Brown Richard J. Nowakowski The neighbourhood polynomial of a graph. 55-68 2008 42 Australas. J Comb. http://ajc.maths.uq.edu.au/pdf/42/ajc_v42_p055.pdf db/journals/ajc/ajc42.html#BrownN08

Jason I. Brown Richard Hoshino The Ehrenfeucht-Fraisse Game for Paths and Cycles. 2007 83 Ars Comb. db/journals/arscom/arscom83.html#BrownH07

Jason I. Brown Richard J. Nowakowski The well-covered dimension of random graphs. 352-355 2007 307 Discret. Math. 3-5 https://doi.org/10.1016/j.disc.2005.09.026 db/journals/dm/dm307.html#BrownN07

Jason I. Brown Richard J. Nowakowski Igor E. Zverovich The structure of well-covered graphs with no cycles of length 4. 2235-2245 2007 307 Discret. Math. 17-18 https://doi.org/10.1016/j.disc.2006.10.011 db/journals/dm/dm307.html#BrownNZ07

Jason I. Brown Xiaohu Li Uniformly optimal digraphs for strongly connected reliability. 145-151 2007 49 Networks 2 https://doi.org/10.1002/net.20148 db/journals/networks/networks49.html#BrownL07

Jason I. Brown Richard J. Nowakowski Average independence polynomials. 313-318 2005 93 J. Comb. Theory B 2 https://doi.org/10.1016/j.jctb.2004.10.001 db/journals/jct/jctb93.html#BrownN05

Jason I. Brown Xiaohu Li The strongly connected reliability of complete digraphs. 165-168 2005 45 Networks 3 https://doi.org/10.1002/net.20060 db/journals/networks/networks45.html#BrownL05

Jason I. Brown Richard J. Nowakowski Well-Covered Vector Spaces of Graphs. 952-965 2005 19 SIAM J. Discret. Math. 4 https://doi.org/10.1137/S0895480101393039 db/journals/siamdm/siamdm19.html#BrownN05

Jason I. Brown Carl A. Hickman Richard J. Nowakowski The k-fractal of a simplicial complex. 33-45 2004 285 Discret. Math. 1-3 https://doi.org/10.1016/j.disc.2003.12.014 db/journals/dm/dm285.html#BrownHN04

Jason I. Brown Carl A. Hickman Richard J. Nowakowski The independence fractal of a graph. 209-230 2003 87 J. Comb. Theory B 2 https://doi.org/10.1016/S0095-8956(02)00014-X db/journals/jct/jctb87.html#BrownHN03

Jason I. Brown Carl A. Hickman On chromatic roots with negative real part. 2002 63 Ars Comb. db/journals/arscom/arscom63.html#BrownH02

Jason I. Brown Carl A. Hickman On chromatic roots of large subdivisions of graphs. 17-30 2002 242 Discret. Math. 1-3 https://doi.org/10.1016/S0012-365X(00)00402-7 https://www.wikidata.org/entity/Q127442792 db/journals/dm/dm242.html#BrownH02

Jason I. Brown Richard J. Nowakowski Bounding the Roots of Independence Polynomials. 2001 58 Ars Comb. db/journals/arscom/arscom58.html#BrownN01

Jason I. Brown Carl A. Hickman Alan D. Sokal David G. Wagner On the Chromatic Roots of Generalized Theta Graphs. 272-297 2001 83 J. Comb. Theory B 2 https://doi.org/10.1006/jctb.2001.2057 https://www.wikidata.org/entity/Q56893275 db/journals/jct/jctb83.html#BrownHSW01

Jason I. Brown Subdivisions and Chromatic Roots. 201-204 1999 76 J. Comb. Theory B 2 https://doi.org/10.1006/jctb.1999.1901 db/journals/jct/jctb76.html#Brown99a

Dimitris Achlioptas Jason I. Brown Derek G. Corneil Michael Molloy 0001 The existence of uniquely -G colourable graphs. 1-11 1998 179 Discret. Math. 1-3 https://doi.org/10.1016/S0012-365X(97)00022-8 db/journals/dm/dm179.html#AchlioptasBCM98

Jason I. Brown Chromatic polynomials and order ideals of monomials. 43-68 1998 189 Discret. Math. 1-3 https://doi.org/10.1016/S0012-365X(97)00277-X db/journals/dm/dm189.html#Brown98

Jason I. Brown On the Roots of Chromatic Polynomials. 251-256 1998 72 J. Comb. Theory B 2 https://doi.org/10.1006/jctb.1997.1813 db/journals/jct/jctb72.html#Brown98

Jason I. Brown The Complexity of Generalized Graph Colorings. 257-270 1996 69 Discret. Appl. Math. 3 https://doi.org/10.1016/0166-218X(96)00096-0 db/journals/dam/dam69.html#Brown96

Jason I. Brown Stephen Watson The number of complements of a topology on n points is at least 2n (except for some special cases). 27-39 1996 154 Discret. Math. 1-3 https://doi.org/10.1016/0012-365X(95)00004-G https://www.wikidata.org/entity/Q126590607 db/journals/dm/dm154.html#BrownW96

Jason I. Brown Richard J. Nowakowski Douglas F. Rall The Ultimate Categorical Independence Ratio of a Graph. 290-300 1996 9 SIAM J. Discret. Math. 2 https://doi.org/10.1137/S0895480194276909 db/journals/siamdm/siamdm9.html#BrownNR96

Jason I. Brown Charles J. Colbourn David G. Wagner Cohen-Macaulay Rings in Network Reliability. 377-392 1996 9 SIAM J. Discret. Math. 3 https://doi.org/10.1137/S0895480194270780 db/journals/siamdm/siamdm9.html#BrownCW96

Jason I. Brown Stephen Watson Mutually complementary partial orders. 27-39 1993 113 Discret. Math. 1-3 https://doi.org/10.1016/0012-365X(93)90506-O db/journals/dm/dm113.html#BrownW93

Jason I. Brown Charles J. Colbourn John S. Devitt Network transformations and bounding network reliability. 1-17 1993 23 Networks 1 https://doi.org/10.1002/net.3230230103 db/journals/networks/networks23.html#BrownCD93

Jason I. Brown A vertex critical graph without critical edges. 99-101 1992 102 Discret. Math. 1 https://doi.org/10.1016/0012-365X(92)90354-I db/journals/dm/dm102.html#Brown92

Jason I. Brown Charles J. Colbourn Roots of the Reliability Polynomial. 571-585 1992 5 SIAM J. Discret. Math. 4 db/journals/siamdm/siamdm5.html#BrownC92 https://doi.org/10.1137/0405047

Jason I. Brown Derek G. Corneil Graph properties and hypergraph colourings. 81-93 1991 98 Discret. Math. 2 https://doi.org/10.1016/0012-365X(91)90034-Y db/journals/dm/dm98.html#BrownC91

Jason I. Brown Vojtech Rödl A ramsey type problem concerning vertex colourings. 45-52 1991 52 J. Comb. Theory B 1 https://doi.org/10.1016/0095-8956(91)90089-3 db/journals/jct/jctb52.html#BrownR91

Jason I. Brown David Kelly Johanan Schönheim Robert E. Woodrow Graph coloring satisfying restraints. 123-143 1990 80 Discret. Math. 2 https://doi.org/10.1016/0012-365X(90)90113-V https://www.wikidata.org/entity/Q125975221 db/journals/dm/dm80.html#BrownKSW90

Jason I. Brown Derek G. Corneil Ali Ridha Mahjoub A note on Ki-perfect graphs. 333-340 1990 14 J. Graph Theory 3 https://doi.org/10.1002/jgt.3190140306 db/journals/jgt/jgt14.html#BrownCM90

Jason I. Brown Charles J. Colbourn A Set System Polynomial with Colouring and Reliability Applications. 151-157 1988 1 SIAM J. Discret. Math. 2 db/journals/siamdm/siamdm1.html#BrownC88 https://doi.org/10.1137/0401017

Jason I. Brown Derek G. Corneil On generalized graph colorings. 87-99 1987 11 J. Graph Theory 1 https://doi.org/10.1002/jgt.3190110113 db/journals/jgt/jgt11.html#BrownC87

Dimitris Achlioptas Iain Beaton Anthony Bonato Ben Cameron Charles J. Colbourn Derek G. Corneil Danielle Cox Corey D. C. DeGagné John S. Devitt Karl Dilcher Richard Ehrenborg Aysel Erey Ian George Mark E. Glickman Christina Graves 0001 Carl A. Hickman R. Hoshino Richard Hoshino David Kelly Yakup KocYakup Koç Theodore Kolokolnikov Robert E. Kooij Xiaohu Li Ali Ridha Mahjoub Dante MannaDante V. Manna Isaac McMullin Dieter Mitsche Lucas Mol Michael Molloy 0001 Richard J. Nowakowski Ortrud R. Oellermann Pawel Pralat Douglas F. Rall Vojtech Rödl Bruce E. Sagan Johanan Schönheim Alan D. Sokal Ryan B. Song Julia Tufts David G. Wagner Stephen Watson Robert E. Woodrow Igor E. Zverovich