Related papers: A Cartesian graph-decomposition theorem based on a…
Mixed connectivity is a generalization of vertex and edge connectivity. A graph is $(p,0)$-connected, $p>0$, if the graph remains connected after removal of any $p-1$ vertices. A graph is $(p,q)$-connected, $p\geq 0$, $q>0$, if it remains…
Vertex splitting is a graph modification operation in which a vertex is replaced by multiple vertices such that the union of their neighborhoods equals the neighborhood of the original vertex. We introduce and study vertex splitting as a…
We develop the theory of $\hbar$-vertex algebras, algebraic structures closely related to vertex algebras but with a deformed translation covariance axiom. We establish their structure theory, including analogues of Goddard's Uniqueness…
Spatiotemporal graph represents a crucial data structure where the nodes and edges are embedded in a geometric space and can evolve dynamically over time. Nowadays, spatiotemporal graph data is becoming increasingly popular and important,…
Using graphs to model irregular information domains is an effective approach to deal with some of the intricacies of contemporary (network) data. A key aspect is how the data, represented as graph signals, depend on the topology of the…
An emerging way to deal with high-dimensional non-euclidean data is to assume that the underlying structure can be captured by a graph. Recently, ideas have begun to emerge related to the analysis of time-varying graph signals. This work…
We develop a new method for constructing approximate decompositions of dense graphs into sparse graphs and apply it to longstanding decomposition problems. For instance, our results imply the following. Let $G$ be a quasi-random $n$-vertex…
We introduce and study the Doubly Balanced Connected graph Partitioning (DBCP) problem: Let $G=(V,E)$ be a connected graph with a weight (supply/demand) function $p:V\rightarrow \{-1,+1\}$ satisfying $p(V)=\sum_{j\in V} p(j)=0$. The…
This paper studies the problem of recovering a hidden vertex correspondence between two correlated graphs when both edge weights and node features are observed. While most existing work on graph alignment relies primarily on edge…
In this paper, we present two main results. First, by only one conjecture (Conjecture 2.9) for recognizing a vertex symmetric graph, which is the hardest task for our problem, we construct an algorithm for finding an isomorphism between two…
We define a graph-based rate optimization problem and consider its computation, which provides a unified approach to the computation of various theoretical limits, including the (conditional) graph entropy, rate-distortion functions and…
We investigate families of two-dimensional simplicial complexes defined in terms of vertex decompositions. They include nonevasive complexes, strongly collapsible complexes of Barmak and Miniam and analogues of 2-trees of Harary and Palmer.…
We define a free product of connected simple graphs that is equivalent to several existing definitions when the graphs are vertex-transitive but differs otherwise. The new definition is designed for the automorphism group of the free…
To analyze data supported by arbitrary graphs G, DSP has been extended to Graph Signal Processing (GSP) by redefining traditional DSP concepts like shift, filtering, and Fourier transform among others. This paper revisits modulation,…
Let $X$ be a finite vertex-transitive graph of valency $d$, and let $A$ be the full automorphism group of $X$. Then the arc-type of $X$ is defined in terms of the sizes of the orbits of the action of the stabiliser $A_v$ of a given vertex…
Let $G$ be a graph of order $n$. A path decomposition $\mathcal{P}$ of $G$ is a collection of edge-disjoint paths that covers all the edges of $G$. Let $p(G)$ denote the minimum number of paths needed in a path decomposition of $G$. Gallai…
We consider a Canonical Polyadic (CP) decomposition approach to low-rank tensor completion (LRTC) by incorporating external pairwise similarity relations through graph Laplacian regularization on the CP factor matrices. The usage of graph…
Many differentially private and classical non-private graph algorithms rely crucially on determining whether some property of each vertex meets a threshold. For example, for the $k$-core decomposition problem, the classic peeling algorithm…
A common way of partitioning graphs is through minimum cuts. One drawback of classical minimum cut methods is that they tend to produce small groups, which is why more balanced variants such as normalized and ratio cuts have seen more…
Traditional directed graph signal processing generally depends on fixed representation matrices, whose rigid structures limit the model's ability to adapt to complex graph topologies. To address this issue, this study employed the unified…