Xian'an Jin

  • Citations Per Year
Learn More
In this paper, we present a formula for computing the Tutte polynomial of the signed graph formed from a labeled graph by edge replacements in terms of the chain polynomial of the labeled graph. Then we define a family of ‘ring of tangles’ links and consider zeros of their Jones polynomials. By applying the formula obtained, Beraha-Kahane-Weiss’s theorem(More)
Let G be a connected plane graph, D(G) be the corresponding link diagram via medial construction, and μ(D(G)) be the number of components of the link diagram D(G). In this paper, we first provide an elementary proof that μ(D(G)) ≤ n(G)+1, where n(G) is the nullity of G. Then we lay emphasis on the extremal graphs, i.e. the graphs with μ(D(G)) = n(G) + 1. An(More)
In this paper, we introduce the Jones polynomial of a graph G = (V,E) with k components as the following specialization of the Tutte polynomial: JG(t) = (−1)|V |−kt|E|−|V TG(−t,−t). We first study its basic properties and determine certain extreme coefficients. Then we prove that (−∞, 0] is a zero-free interval of Jones polynomials of connected bridgeless(More)
In this paper, we introduce a notion of ear decomposition of 3-regular polyhedral links based on the ear decomposition of the 3-regular polyhedral graphs. As a result, we obtain an upper bound for the braid index of 3-regular polyhedral links. Our results may be used to characterize and analyze the structure and complexity of protein polyhedra and(More)
  • 1