Related papers: Smooth Graphs
The construction of a meaningful graph plays a crucial role in the success of many graph-based representations and algorithms for handling structured data, especially in the emerging field of graph signal processing. However, a meaningful…
We extend the notion of graph homomorphism to cellularly embedded graphs (maps) by designing operations on vertices and edges that respect the surface topology; we thus obtain the first definition of map homomorphism that preserves both the…
While orthogonal drawings have a long history, smooth orthogonal drawings have been introduced only recently. So far, only planar drawings or drawings with an arbitrary number of crossings per edge have been studied. Recently, a lot of…
Hypergraph is a general way of representing high-order relations on a set of objects. It is a generalization of graph, in which only pairwise relations can be represented. It finds applications in various domains where relationships of more…
Network-topology inference from (vertex) signal observations is a prominent problem across data-science and engineering disciplines. Most existing schemes assume that observations from all nodes are available, but in many practical…
In \emph{smooth orthogonal layouts} of planar graphs, every edge is an alternating sequence of axis-aligned segments and circular arcs with common axis-aligned tangents. In this paper, we study the problem of finding smooth orthogonal…
We start up the study of the stability of general graph pairs. This notion is a generalization of the concept of the stability of graphs. We say that a pair of graphs $(\Gamma,\Sigma)$ is stable if $Aut(\Gamma\times\Sigma) \cong…
Token graphs, or symmetric powers of graphs, see \cite{alavi2002survey} and \cite{Fabila-Monroy2012}, are defined on the $k$-combinations of the vertex set of some graph $L$, where edges exist between two such combinations, if their…
These lecture notes are a personal introduction to signed graphs, concentrating on the aspects that have been most persistently interesting to me. They are just a few corners of signed graph theory; I am leaving out a great deal. The…
A graph is called normal if its vertex set can be covered by cliques and also by stable sets, such that every such clique and stable set have non-empty intersection. This notion is due to Korner, who introduced the class of normal graphs as…
Graphs that are squares under the gluing algebra arise in the study of homomorphism density inequalities such as Sidorenko's conjecture. Recent work has focused on these homomorphism density applications. This paper takes a new perspective…
The paper is devoted to metric properties of singularities. We investigate the relations among topology, metric properties and smoothness. In particular, we present some higher dimensional analogous of Mumford's theorem on smoothness of…
For a general $k$-gonal curve $C$ with a morphism $f: C \rightarrow \mathbb{P}^1$ of degree $k$, we consider the refinement of the Brill-Noether schemes $W^r_d(C)$ by means of the Brill-Noether degeneracy schemes…
Graph learning is often a necessary step in processing or representing structured data, when the underlying graph is not given explicitly. Graph learning is generally performed centrally with a full knowledge of the graph signals, namely…
Median graphs are connected graphs in which for all three vertices there is a unique vertex that belongs to shortest paths between each pair of these three vertices. To be more formal, a graph $G$ is a median graph if, for all $\mu, u,v\in…
For a smooth function on a smooth manifold of a suitable class, the space of all connected components of preimages is the graph and called the {\it Reeb graph}. Reeb graphs are fundamental tools in the algebraic and differential topological…
We consider a generalization of the concept of $d$-flattenability of graphs - introduced for the $l_2$ norm by Belk and Connelly - to general $l_p$ norms, with integer $P$, $1 \le p < \infty$, though many of our results work for $l_\infty$…
In this review we establish various connections between complex networks and symmetry. While special types of symmetries (e.g., automorphisms) are studied in detail within discrete mathematics for particular classes of deterministic graphs,…
A sum graph is a finite simple graph whose vertex set is labeled with distinct positive integers such that two vertices are adjacent if and only if the sum of their labels is itself another label. The spum of a graph $G$ is the minimum…
We develop a theory of confluence of graphs. We describe an algorithm for proving that a given system of reduction rules for abstract graphs and graphs in surfaces is locally confluent. We apply this algorithm to show that each simple Lie…