Related papers: The entanglement of some non-two-colorable graph s…

The entanglement of graph states up to eight qubits is calculated in the regime of iteration calculation. The entanglement measures could be the relative entropy of entanglement, the logarithmic robustness or the geometric measure. All 146…

A coloring of a graph is an assignment of colors to its vertices such that adjacent vertices have different colors. Two colorings are equivalent if they induce the same partition of the vertex set into color classes. Let $\mathcal{A}(G)$ be…

In the paper we state and prove theorem describing the upper bound on number of the graphs that have fixed number of vertices |V| and can be colored with the fixed number of n colors. The bound relates both numbers using power of 2, while…

We propose the definition of the geometric measure of entanglement for continuous variable states. On the basis of this definition we examine entanglement of the graph states obtained as a result of action of a unitary operator on the…

We study the average number $\mathcal{A}(G)$ of colors in the non-equivalent colorings of a graph $G$. We show some general properties of this graph invariant and determine its value for some classes of graphs. We then conjecture several…

We propose a new classification for the entanglement in graph states based on generalized con- currence. The numerical results indicate that the eight different three-qubit graph states in three categories, 64 four-qubit graph states in…

An odd coloring of a graph $G$ is a proper vertex coloring $\varphi$ with the property that for each non-isolated vertex $v\in V(G)$, there exists a color $c$ such that the cardinality of $\varphi^{-1}(c)\cap N(v)$ is odd. The concept of…

We use the concept of \textit{entangled graphs} with weighted edges to present a classification for four-qubit entanglement which is based neither on the LOCC nor the SLOCC. Entangled graphs, first introduced by Plesch et al. [Phys. Rev. A…

We consider graph states of arbitrary number of particles undergoing generic decoherence. We present methods to obtain lower and upper bounds for the system's entanglement in terms of that of considerably smaller subsystems. For an…

We obtain several new upper bounds of the odd graceful chromatic number of a graph $G$, which must be bipartite. Some of our bounds depend only on the number of the vertices of $G$ or the chromatic number of some graphs related to the…

In this short note we show that every connected $2$-edge coloured cubic graph admits an $10$-colouring. This lowers the best known upper bound for the chromatic number of connected $2$-edge coloured cubic graphs.

A proper vertex colouring of a graph is \emph{nested} if the vertices of each of its colour classes can be ordered by inclusion of their open neighbourhoods. Through a relation to partially ordered sets, we show that the nested chromatic…

We consider quantum graph states that can be mapped to directed weighted graphs, also known as directed networks. The geometric measure of entanglement of the states is calculated for the quantum graph states corresponding to arbitrary…

We investigate the properties of different levels of entanglement in graph states which correspond to connected graphs. Combining the operational definition of graph states and the postulates of entanglement measures, we prove that in…

We introduce new sufficient conditions for intrinsic knotting and linking. A graph on n vertices with at least 4n-9 edges is intrinsically linked. A graph on n vertices with at least 5n-14 edges is intrinsically knotted. We also classify…

A proper labelling of a graph $G$ is a pair $({\pi},c_{\pi})$ in which ${\pi}$ is an assignment of numeric labels to some elements of $G$, and $c_{\pi}$ is a colouring induced by ${\pi}$ through some mathematical function over the set of…

Graph states form a rich class of entangled states that exhibit important aspects of multi-partite entanglement. At the same time, they can be described by a number of parameters that grows only moderately with the system size. They have a…

A hypergraph is said to be properly 2-colorable if there exists a 2-coloring of its vertices such that no hyperedge is monochromatic. On the other hand, a hypergraph is called non-2-colorable if there exists at least one monochromatic…

Let $G$ be a finite, connected graph. The eccentricity of a vertex $v$ of $G$ is the distance from $v$ to a vertex farthest from $v$. The average eccentricity of $G$ is the arithmetic mean of the eccentricities of the vertices of $G$. We…

An edge-weighting of a graph is called vertex-coloring if the weighted degrees yield a proper vertex coloring of the graph. It is conjectured that for every graph without isolated edge, a vertex-coloring edge-weighting with the set {1,2,3}…