#### Filter Results:

- Full text PDF available (27)

#### Publication Year

1962

2017

- This year (1)
- Last 5 years (20)
- Last 10 years (36)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Jason I. Brown, Charles J. Colbourn
- SIAM J. Discrete Math.
- 1992

- Jason I. Brown, Richard J. Nowakowski, Douglas F. Rall
- SIAM J. Discrete Math.
- 1996

Let /(G) denote the independence number of a graph G. We introduce A(G) limk-. (Gk)/IV(G)I k, where the categorical graph product is used. This limit, surprisingly, lies in the range (0,1/2] U (1. We can show that this limit can take any such rational number, but is there any G for which A(G) is irrational? A useful technique for bounding A(G) is to… (More)

- Jason I. Brown, Richard J. Nowakowski, Igor E. Zverovich
- Discrete Mathematics
- 2007

- John A. Christopher, Jason I. Brown, +9 authors Miles S Congreve
- Journal of medicinal chemistry
- 2013

Biophysical fragment screening of a thermostabilized β1-adrenergic receptor (β1AR) using surface plasmon resonance (SPR) enabled the identification of moderate affinity, high ligand efficiency (LE) arylpiperazine hits 7 and 8. Subsequent hit to lead follow-up confirmed the activity of the chemotype, and a structure-based design approach using protein-ligand… (More)

- Jason I. Brown
- 2000

Let G be a well covered graph, that is, all maximal independent sets of G have the same cardinality, and let ik denote the number of independent sets of cardinality k in G. We investigate the roots of the independence polynomial i(G, x)= ∑ ik xk . In particular, we show that if G is a well covered graph with independence number β, then all the roots of i(G,… (More)

Suppose that each edge of a connected graph G of order n is independently operational with probability p; the reliability of G is the probability that the operational edges form a spanning connected subgraph. A useful expansion of the reliability is as pn-1 5dj=0 Hi(l — p ) i , and the Ball-Provan method for bounding reliability relies on Stanley's… (More)

- Jason I. Brown, Derek G. Corneil
- Journal of Graph Theory
- 1987

- Jason I. Brown, Vojtech Rödl
- J. Comb. Theory, Ser. B
- 1991

- Jason I. Brown
- Discrete Mathematics
- 1992

- Jason I. Brown, Charles J. Colbourn, John S. Devitt
- Networks
- 1993