Related papers: Circuit partitions and signed interlacement in 4-r…
Graph states are special kinds of multipartite entangled states that correspond to mathematical graphs where the vertices take the role of quantum spin systems and the edges represent interactions. They not only provide an efficient model…
We show that opacity of a clean multilayer graphene flake depends on the helicity of the circular polarized electromagnetic radiation. The effect can be understood in terms of the pseudospin selection rules for the interband optical…
This paper studies induced paths in strongly regular graphs. We give an elementary proof that a strongly regular graph contains a path $P_4$ as an induced subgraph if and only if it is primitive, i.e. it is neither a complete multipartite…
An \emph{adjacency labeling scheme} for a given class of graphs is an algorithm that for every graph $G$ from the class, assigns bit strings (labels) to vertices of $G$ so that for any two vertices $u,v$, whether $u$ and $v$ are adjacent…
We characterise the quartic (i.e. 4-regular) multigraphs with the property that every edge lies in a triangle. The main result is that such graphs are either squares of cycles, line multigraphs of cubic multigraphs, or are obtained from…
The geometric dual of a cellularly embedded graph is a fundamental concept in graph theory and also appears in many other branches of mathematics. The partial dual is an essential generalization which can be obtained by forming the…
Partition of unity methods (PUMs) on graphs represent straightforward and remarkably adaptable auxiliary techniques for graph signal processing. By relying solely on the intrinsic graph structure, we propose the generation of a partition of…
An independent set of a graph $G$ is a vertex subset $I$ such that there is no edge joining any two vertices in $I$. Imagine that a token is placed on each vertex of an independent set of $G$. The $\mathsf{TS}$- ($\mathsf{TS}_k$-)…
Quantum systems with short range interactions are known to respect an area law for the entanglement entropy: the von Neumann entropy $S$ associated to a bipartition scales with the boundary $p$ between the two parts. Here we study the case…
Ex-so-tic van der Waals heterostructures take advantage of the electrically tunable layer polarization to swap proximity exchange and spin-orbit coupling in the electronically active region. Perhaps the simplest example is Bernal bilayer…
Let $\mathcal{G}_{\alpha}$ be a hereditary graph class (i.e, every subgraph of $G_{\alpha}\in \mathcal{G}_{\alpha}$ belongs to $\mathcal{G}_{\alpha}$) such that every graph $G_{\alpha}$ in $\mathcal{G}_{\alpha}$ has minimum degree at most…
Consider a connected graph $G$ and let $T$ be a spanning tree of $G$. Every edge $e \in G-T$ induces a cycle in $T \cup \{e\}$. The intersection of two distinct such cycles is the set of edges of $T$ that belong to both cycles. The MSTCI…
It was shown by Beisegel, Chudnovsky, Gurvich, Milani\v{c}, and Servatius in 2022 that every induced $2$-edge path in a vertex-transitive graph closes to an induced cycle. Similar results were obtained for 3-edge paths closing to cycles in…
We introduce a categorical formalism for rewriting surface-embedded graphs. Such graphs can represent string diagrams in a non-symmetric setting where we guarantee that the wires do not intersect each other. The main technical novelty is a…
We show that if the two parts of a finite bipartite graph have the same degree sequence, then there is a bipartite graph, with the same degree sequences, which is symmetric, in that it has an involutive graph automorphism that interchanges…
We investigate bipartite entanglement in spin-1/2 systems on a generic lattice. For states that are an equal superposition of elements of a group $G$ of spin flips acting on the fully polarized state $\ket{0}^{\otimes n}$, we find that the…
Every 4-connected graph $G$ with minimum degree $\delta$ and connectivity $\kappa$ either contains a cycle of length at least $4\delta-\kappa-4$ or every longest cycle in $G$ is a dominating cycle.
We study the entanglement spectrum (ES) of two-dimensional $C_{n}$-symmetric second-order topological insulators (TIs). We show that some characteristic higher order topological observables, e.g., the filling anomaly and its associated…
Over all graphs (or unicyclic graphs) of a given order, we characterise those graphs that minimise or maximise the number of connected induced subgraphs. For each of these classes, we find that the graphs that minimise the number of…
We study the correlations (and alignment as a particular case) existent between the fragments originated in a decaying process when the daughter particles interact. The interaction between the particles is modeled using the potential of…