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 ...

D. CVETKOVIĆ, M. LEPOVIĆ, SEEKING COUNTEREXAMPLES TO THE RECONSTRUCTION CONJECTURE FOR THE CHARACTERISTIC POLYNOMIAL OF GRAPHS AND A POSITIVE RESULT, Bulletin (Académie serbe des sciences et des arts.

In this paper we study the unimodality properties of 𝐼 (𝐺;𝑥) for some composite graphs 𝐺. Given two graphs 𝐺₁ and 𝐺₂, let 𝐺₁ (𝐺₂) denote the lexicographic product of 𝐺₁ and 𝐺₂.

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 ...