Graph polynomials serve as robust algebraic encodings of the intricate combinatorial properties inherent to graphs. At the heart of this discipline lies the Tutte polynomial, an invariant that not ...

The quantum Bruhat graph, which is an extension of the graph formed by covering relations in the Bruhat order, is naturally related to the quantum cohomology ring of G/B. We enhance a result of Fulton ...

We derive a formula for the chromatic polynomial of a chordal or a triangulated graph in terms of its maximal cliques. As a corollary we obtain a way to write down an explicit formula for the ...

Different types of graphs and charts are needed to present results from experiments. Graphs and charts need to be drawn and labelled correctly. Use patterns in the data to reach a conclusion in an ...

Jason I. Brown, Yakup Koc and Robert Kooij, Inflection Points for Network Reliability, Telecommunication Systems Journal, accepted for publication. Jason I. Brown and Julia Tufts, On the Roots of ...