Related papers: Extreme coefficients of Jones polynomials and grap…

This paper defines versions of the Jones polynomial and Khovanov homology by using several maps from the set of Gauss diagrams to its variant. Through calculation of some examples, this paper also shows that these versions behave…

We explore graph theoretical properties of minimal prime graphs of finite solvable groups. In finite group theory studying the prime graph of a group has been an important topic for the past almost half century. Recently prime graphs of…

We present an example of a result in graph theory that is used to obtain a result in another branch of mathematics. More precisely, we show that the isomorphism of certain directed graphs implies that some trinomials over finite fields have…

Extremal Graph Theory is a very deep and wide area of modern combinatorics. It is very fast developing, and in this long but relatively short survey we select some of those results which either we feel very important in this field or which…

We study finite graphs embedded in oriented surfaces by associating a polynomial to it. The tools used in developing a theory of such graph polynomials are algebraic topological while the polynomial itself is inspired from ideas arising in…

We calculate Jones polynomials $V(H_r,t)$ for a family of alternating knots and links $H_r$ with arbitrarily many crossings $r$, by computing the Tutte polynomials $T(G_+(H_r),x,y)$ for the associated graphs $G_+(H_r)$ and evaluating these…

We consider entropy-optimal graphons associated with extreme and near-extreme constraints on the densities of edges and triangles. We prove that the optimizers for near-extreme constraints are unique and multipodal and are perturbations of…

In this paper, we study the characteristic polynomials of the line graphs of generalized Bethe trees. We give an infinite family of such graphs sharing the same smallest eigenvalue. Our family generalizes the family of coronas of complete…

In this paper, we continue the classification work done in the first paper of the same name. With careful modifications of our previous approach, we are able to deduce (with two notable exceptions) which members of the previously introduced…

The domination polynomial of a graph $G$ is given by $D(G,x)=\sum_{k=0}^{n} d_k(G)x^k$ where $d_k(G)$ records the number of $k$-element dominating sets in $G$. A conjecture of Alikhani and Peng asserts that these polynomials have unimodal…

We investigate prime character degree graphs of solvable groups. In particular, we consider a family of graphs $\Gamma_{k,t}$ constructed by adjoining edges between two complete graphs in a one-to-one fashion. In this paper we determine…

We study near-alternating links whose diagrams satisfy conditions generalized from the notion of semi-adequate links. We extend many of the results known for adequate knots relating their colored Jones polynomials to the topology of…

In this paper I survey the sources of inspiration for my own and co-authored work in trying to develop a general theory of graph polynomials. I concentrate on meta-theorems, i.e., theorem which depend only on the form infinite classes of…

This paper is a memory of the work and influence of Vaughan Jones. It is an exposition of the remarkable breakthroughs in knot theory and low dimensional topology that were catalyzed by his work. The paper recalls the inception of the Jones…

In this notice, we revisit the recent work [1] of Jung Yoog Kang and Tai Sup about special polynomials with exponential distribution in order to state some improvements and get new proofs for results therein.

A link is almost alternating if it is non-alternating and has a diagram that can be transformed into an alternating diagram via one crossing change. We give formulas for the first two and last two potential coefficients of the Jones…

Each graph and choice of a commutative ring gives rise to an associated graphical group. In this article, we introduce and investigate graph polynomials that enumerate conjugacy classes of graphical groups over finite fields according to…

McCarty and Thomas conjectured that a linklessly embeddable graph with $n\ge 7 $ vertices and $t$ triangles has at most $3n-9 +\frac{t}{3}$ edges. Thomas and Yoo proved this to be true for apex graphs. We give a shorter and simpler proof…

This paper surveys some recent results and progress on the extremal prob- lems in a given set consisting of all simple connected graphs with the same graphic degree sequence. In particular, we study and characterize the extremal graphs…

We study graph parameters whose associated edge-connection matrices have exponentially bounded rank growth. Our main result is an explicit construction of a large class of graph parameters with this property that we call mixed partition…