News
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 ...
Bao-Xuan Zhu α΅, Qinglin Lu α΅, Unimodality of the Independence Polynomials of Some Composite Graphs, Filomat, Vol. 31, No. 3 (2017), pp. 629-637 ...
Finally, we conclude by discussing the domination polynomials of a related family of graphs, the π-book graphs π΅π, formed by joining π copies of the cycle graph πΆβ with a common edge. The journal ...
Jason I. Brown and Julia Tufts, On the Roots of Domination Polynomials, Graphs and Combinatorics, accepted for publication. Jason I. Brown, Karl Dilcher and Dante Manna, On a Sequence of Sparse ...
Office Number: Chase Room 204 Scholarly Interests: Chromatic polynomials, Network reliability, Independence in Graphs, Simplicial Complexes,Mathematics and Music. Publications: Jason I. Brown, Yakup ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback