Realizing string-net condensation: Fibonacci anyon braiding for universal gates and sampling chromatic polynomials [PDF]
The remarkable complexity of a topologically ordered many-body quantum system is encoded in the characteristics of its anyons. Quintessential predictions emanating from this complexity employ the Fibonacci string net condensate (Fib SNC) and its anyons ...
Zlatko K. Minev +7 more
doaj +3 more sources
New bounds for chromatic polynomials and chromatic roots [PDF]
If G is a k -chromatic graph of order n then it is known that the chromatic polynomial of G , π ( G , x ) , is at most x ( x - 1 ) ? ( x - ( k - 1 ) ) x n - k = ( x ) ? k x n - k for every x ? N . We improve here this bound by showing that π ( G , x ) ? (
Jason I Brown, Aysel Erey
exaly +4 more sources
Algorithms for computing chromatic polynomials and chromatic index polynomials
Objectives: The aim of this article is to enhance the understanding of the computation of chromatic polynomials and chromatic index polynomials, and to facilitate their practical use in various fields by demonstrating and supporting the proposed ...
Mamo Abebe Ashebo +2 more
exaly +4 more sources
Connection between Graphs' Chromatic and Ehrhart Polynomials [PDF]
Graph Theory is a discipline of mathematics with numerous outstanding issues and applications in a variety of sectors of mathematics and science. The chromatic polynomial is a type of polynomial that has useful and attractive qualities.
Ola Neamah, Shatha Salman
doaj +2 more sources
Problems on chromatic polynomials of hypergraphs
Chromatic polynomials of graphs have been studied extensively for around one century. The concept of chromatic polynomial of a hypergraph is a natural extension of chromatic polynomial of a graph. It also has been studied for more than 30 years.
Ruixue Zhang, Fengming Dong
doaj +2 more sources
Application of maple on computing strong fuzzy chromatic polynomial of fuzzy graphs [PDF]
Objective In the field of graph theory, maple is a technical computation form that is used for solving problems. In this article, we apply maple to find the strong fuzzy chromatic polynomial of fuzzy graphs and related. Moreover, we apply maple to obtain
Mamo Abebe Ashebo +2 more
doaj +2 more sources
Note on chromatic polynomials of the threshold graphs
Let G be a threshold graph. In this paper, we give, in first hand, a formula relating the chromatic polynomial of Ḡ (the complement of G) to the chromatic polynomial of G.
Noureddine Chikh, Miloud Mihoubi
doaj +2 more sources
Properties of chromatic polynomials of hypergraphs not held for chromatic polynomials of graphs [PDF]
In this paper, we present some properties on chromatic polynomials of hypergraphs which do not hold for chromatic polynomials of graphs. We first show that chromatic polynomials of hypergraphs have all integers as their zeros and contain dense real zeros
Ruixue Zhang, F. Dong
semanticscholar +4 more sources
Chromatic Polynomials of Oriented Graphs [PDF]
The oriented chromatic polynomial of a oriented graph outputs the number of oriented $k$-colourings for any input $k$. We fully classify those oriented graphs for which the oriented graph has the same chromatic polynomial as the underlying simple graph ...
Danielle Cox, Christopher Duffy
semanticscholar +5 more sources
Measurement of Longitudinal Chromatic Aberration in the Last Crystalline Lens Surface Using Hartmann Test and Purkinje Images [PDF]
Research has shown that longitudinal chromatic aberration (LCA) of the human eye is generated across all of the eye’s optical surfaces. However, it may not be necessary to measure the LCA from the first surface of the cornea to the retina, as it is known
Uriel Calderon-Uribe +2 more
doaj +2 more sources

