Related papers: A Nonvanishing Spectral Gap for AKLT Models on Gen…

A graph on $n$ vertices is equitably $k$-colorable if it is $k$-colorable and every color is used either $\left\lfloor n/k \right\rfloor$ or $\left\lceil n/k \right\rceil$ times. Such a problem appears to be considerably harder than vertex…

We introduce a multi-parameter deformation of the Fredkin spin $1/2$ chain whose ground state is a weighted superposition of Dyck paths, depending on a set of parameters $t_i$ along the chain. The parameters are introduced in such a way to…

In the context of algorithm theory, various studies have been conducted on spanning trees with desirable properties. In this paper, we consider the \textsc{Minimum Cover Spanning Tree} problem (MCST for short). Given a graph $G$ and a…

This paper investigates an extremely classic NP-complete problem: How to determine if a graph G, where each vertex has a degree of at most 4, can be 3-colorable(The research in this paper focuses on graphs G that satisfy the condition where…

We consider a quantum mechanical particle living on a graph and discuss the behaviour of its wavefunction at graph vertices. In addition to the standard (or delta type) boundary conditions with continuous wavefunctions, we investigate two…

We study intrinsically linked graphs where we require that every embedding of the graph contains not just a non-split link, but a link that satisfies some additional property. Examples of properties we address in this paper are: a two…

For graphs $G$ and $H$, an $H$-colouring of $G$ is a map $\psi:V(G)\rightarrow V(H)$ such that $ij\in E(G)\Rightarrow\psi(i)\psi(j)\in E(H)$. The number of $H$-colourings of $G$ is denoted by $\hom(G,H)$. We prove the following: for all…

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 prove that if an $n$-vertex graph $G$ is non-extremal and $T$ is a bounded degree tree on $n$ vertices, then $T\subset G$ even when the minimum degree of $G$ is less than $n/2$ by a linear term. We avoid the use of the Regularity lemma,…

Constructing appropriate representations of molecules lies at the core of numerous tasks such as material science, chemistry and drug designs. Recent researches abstract molecules as attributed graphs and employ graph neural networks (GNN)…

Symmetry-resolved entanglement is a useful tool for characterizing symmetry-protected topological states. In two dimensions, their entanglement spectra are described by conformal field theories but the symmetry resolution is largely…

Let $G$ be a connected graph and let $k$ be a positive integer. Let $T$ be a spanning tree of $G$. The leaf degree of a vertex $v\in V(T)$ is defined as the number of leaves adjacent to $v$ in $T$. The leaf degree of $T$ is the maximum leaf…

Linear rank-width is a graph width parameter, which is a variation of rank-width by restricting its tree to a caterpillar. As a corollary of known theorems, for each $k$, there is a finite obstruction set $\mathcal{O}_k$ of graphs such that…

Motivated by the appearance of fractals in several areas of physics, especially in solid state physics and the physics of aperiodic order, and in other sciences, including the quantum information theory, we present a detailed spectral…

The GG-width of a class of graphs GG is defined as follows. A graph G has GG-width k if there are k independent sets N1,...,Nk in G such that G can be embedded into a graph H in GG such that for every edge e in H which is not an edge in G,…

We propose the fully explainable Decision Tree Graph Neural Network (DT+GNN) architecture. In contrast to existing black-box GNNs and post-hoc explanation methods, the reasoning of DT+GNN can be inspected at every step. To achieve this, we…

We study a three-leg spin-1/2 ladder with geometrically frustrated interleg interactions. We call this model an anisotropic triangular-strip (ATS) model. We numerically and field-theoretically show that its ground state belongs to a gapless…

The metric dimension of non-component graph, associated to a finite vector space, is determined. It is proved that the exchange property holds for resolving sets of the graph, except a special case. Some results are also related to an…

A graph $G$ is called a complete $k$-partite ($k\geq 2$) graph if its vertices can be partitioned into $k$ independent sets $V_{1},...,V_{k}$ such that each vertex in $V_{i}$ is adjacent to all the other vertices in $V_{j}$ for $1\leq…

In this work we investigate the decorated domain wall construction in bosonic group-cohomology symmetry-protected topological (SPT) phases and related quantum anomalies in bosonic topological phases. We first show that a general decorated…