Related papers: Approximation of a general singular vertex couplin…
We investigate properties which ensure that a given finite graph is the commuting graph of a group or semigroup. We show that all graphs on at least two vertices such that no vertex is adjacent to all other vertices is the commuting graph…
We show that large subsets of vector spaces over finite fields determine certain point configurations with prescribed distance structure. More specifically, we consider the complete graph with vertices as the points of $A \subseteq…
We give a simple approximation algorithm for a common generalization of many previously studied extensions of the maximum size stable matching problem with ties. These generalizations include the existence of critical vertices in the graph,…
Bounds on the minimum degree and on the number of vertices at- taining it have been much studied for finite edge-/vertex-minimally k- connected/k-edge-connected graphs. We give an overview of the results known for finite graphs, and show…
Given a graph $G$, the Connected Vertex Cover problem (CVC) asks to find a minimum cardinality vertex cover of $G$ that induces a connected subgraph. In this paper we describe some approaches to solve the CVC problem exactly. First, we give…
The Quantum Approximate Optimization Algorithm can naturally be applied to combinatorial search problems on graphs. The quantum circuit has p applications of a unitary operator that respects the locality of the graph. On a graph with…
The aim of the paper is to investigate resonances in quantum graphs with a general self-adjoint coupling in the vertices and their trajectories with respect to varying edge lengths. We derive formulae determining the Taylor expansion of the…
In this paper we consider two natural notions of connectivity for hypergraphs: weak and strong. We prove that the strong vertex connectivity of a connected hypergraph is bounded by its weak edge connectivity, thereby extending a theorem of…
The widely studied edge modification problems ask how to minimally alter a graph to satisfy certain structural properties. In this paper, we introduce and study a new edge modification problem centered around transforming a given graph into…
We investigate the computationally hard problem whether a random graph of finite average vertex degree has an extensively large $q$-regular subgraph, i.e., a subgraph with all vertices having degree equal to $q$. We reformulate this problem…
The symmetries of a finite graph are described by its automorphism group; in the setting of Woronowicz's quantum groups, a notion of a quantum automorphism group has been defined by Banica capturing the quantum symmetries of the graph. In…
We investigate the behavior of vertex-weighted exponential random graphs. We show that vertex-weighted exponential random graphs with edge weights induced by products of independent vertex weights are approximate mixtures of graphs whose…
We study the Minimum Sum Vertex Cover problem, which asks for an ordering of vertices in a graph that minimizes the total cover time of edges. In particular, n vertices of the graph are visited according to an ordering, and for each edge…
A straight-line drawing $\delta$ of a planar graph $G$ need not be plane, but can be made so by \emph{untangling} it, that is, by moving some of the vertices of $G$. Let shift$(G,\delta)$ denote the minimum number of vertices that need to…
The graph is one of the most widely used mathematical structures in engineering and science because of its representational power and inherent ability to demonstrate the relationship between objects. The objective of this work is to…
Quantum algorithms for graph problems are considered, both in the adjacency matrix model and in an adjacency list-like array model. We give almost tight lower and upper bounds for the bounded error quantum query complexity of Connectivity,…
We investigate a family of quantum states defined by directed graphs, where the oriented edges represent interactions between ordered qubits. As a measure of entanglement, we adopt the Entanglement Distance - a quantity derived from the…
The goal of this paper is to provide a general purpose result for the coupling of exploration processes of random graphs, both undirected and directed, with their local weak limits when this limit is a marked Galton-Watson process. This…
We introduce a variant of the vertex-distinguishing edge coloring problem, where each edge is assigned a subset of colors. The label of a vertex is the union of the sets of colors on edges incident to it. In this paper we investigate the…
Multi-qubit quantum states corresponding to bipartite graphs $G(U,V,E)$ are examined. These states are constructed by applying $CNOT$ gates to an arbitrary separable multi-qubit quantum state. The entanglement distance of the resulting…