Related papers: Generalized duality for graphs on surfaces and the…
This paper has dual aims. First is to develop practical universal coding methods for unlabeled graphs. Second is to use these for graph anomaly detection. The paper develops two coding methods for unlabeled graphs: one based on the degree…
A signed graph is said to be sign-symmetric if it is switching isomorphic to its negation. Bipartite signed graphs are trivially sign-symmetric. We give new constructions of non-bipartite sign-symmetric signed graphs. Sign-symmetric signed…
In the second, fourth and fifth authors' previous work, a duality on generic real analytic cuspidal edges in the Euclidean 3-space $\boldsymbol R^3$ preserving their singular set images and first fundamental forms, was given. Here, we call…
We investigate the problem of constructing planar drawings with few bends for two related problems, the partially embedded graph problem---to extend a straight-line planar drawing of a subgraph to a planar drawing of the whole graph---and…
We investigate the problem of determining if a given graph corresponds to the dual of a triangulation of a simple polygon. This is a graph recognition problem, where in our particular case we wish to recognize a graph which corresponds to…
In the present paper, we propose a new discrete surface theory on 3-valent embedded graphs in the 3-dimensional Euclidean space which are not necessarily discretization or approximation of smooth surfaces. The Gauss curvature and the mean…
Pairs of graded graphs, together with the Fomin property of graded graph duality, are rich combinatorial structures providing among other a framework for enumeration. The prototypical example is the one of the Young graded graph of integer…
The dual complex associated to a resolution of singularities generalizes the notion of a resolution graph of a surface singularity to any dimension. We show that homotopy type of the dual complex is an invariant of an isolated singularity.
We characterize all permutations which realize as the $z$-monodromies of faces in connected simple finite graphs embedded in surfaces whose duals are also simple.
We interpret a normal surface in a (singular) three-manifold in terms of the homology of a chain complex. This allows us to study the relation between normal surfaces and their quadrilateral co-ordinates. Specifically, we give a proof of an…
Graph embedding techniques are pivotal in real-world machine learning tasks that operate on graph-structured data, such as social recommendation and protein structure modeling. Embeddings are mostly performed on the node level for learning…
We introduce a natural notion of holomorphic map between generalized complex manifolds and we prove some related results on Dirac structures and generalized Kaehler manifolds.
These are lecture notes for the Current Developments in Mathematics conference at Harvard, November, 2011. We discuss topological, probabilistic and combinatorial aspects of the Laplacian on a graph embedded on a surface. The three main…
A graph drawing in the plane is called an almost embedding if the images of any two non-adjacent simplices (i.e. vertices or edges) are disjoint. Almost embeddings (more precisely, their higher-dimensional analogues) naturally appear in…
The correspondence between 2-parameter families of oriented lines in ${\Bbb{R}}^3$ and surfaces in $T{\Bbb{P}}^1$ is studied, and the geometric properties of the lines are related to the complex geometry of the surface. Congruences…
Mutual visibility in graphs provides a framework for analysing how vertices can observe one another along shortest paths free of internal obstructions. The visibility polynomial, which enumerates mutual-visibility sets of all orders, has…
A generalized vertex join of a graph is obtained by joining an arbitrary multiset of its vertices to a new vertex. We present a low-order polynomial time algorithm for finding the chromatic polynomials of generalized vertex joins of trees,…
We consider the concept of a generalised manifold in the O(d,d) setting, i.e., in double geometry. The conjecture by Hohm and Zwiebach for the form of finite generalised diffeomorphisms is shown to hold. Transition functions on overlaps are…
For each graph on two vertices, and each divisor on the graph in the sense of Baker-Norine, we describe a sheaf of vector spaces on a finite category whose zeroth Betti number is the Baker-Norine "Graph Riemann-Roch" rank of the divisor…
In order to apply quantum topology methods to nonplanar graphs, we define a planar diagram category that describes the local topology of embeddings of graphs into surfaces. These \emph{virtual graphs} are a categorical interpretation of…