Related papers: The Structure and Enumeration of Link Projections
This article defines a pair of combinatorial operations on the combinatorial structure of compact right-angled hyperbolic polyhedra in dimension three called decomposition and edge surgery. It is shown that these operations simplify the…
Hierarchical graph clustering is a common technique to reveal the multi-scale structure of complex networks. We propose a novel metric for assessing the quality of a hierarchical clustering. This metric reflects the ability to reconstruct…
We construct tree-decompositions of graphs that distinguish all their k-blocks and tangles of order k, for any fixed integer k. We describe a family of algorithms to construct such decompositions, seeking to maximize their diversity subject…
Knots are commonly represented and manipulated via diagrams, which are decorated planar graphs. When such a knot diagram has low treewidth, parameterized graph algorithms can be leveraged to ensure the fast computation of many invariants…
We describe the structure of 2-connected non-planar toroidal graphs with no K_{3,3}-subdivisions, using an appropriate substitution of planar networks into the edges of certain graphs called toroidal cores. The structural result is based on…
In distributed systems, knowledge of the network structure of the connections among the unitary components is often a requirement for an accurate prediction of the emerging collective dynamics. However, in many real-world situations, one…
Modern problems of concept annotation associate an object of interest (gene, individual, text document) with a set of interrelated textual descriptors (functions, diseases, topics), often organized in concept hierarchies or ontologies. Most…
We define a special case of tree decompositions for planar graphs that respect a given embedding of the graph. We study the analogous width of the resulting decomposition we call the embedded-width of a plane graph. We show both upper…
This paper is a continuation on the 2012 paper on "Cutting Twisted Solid Tori (TSTs)", in which we considered twisted solid torus links (tst links). We generalize the notion of tst links to "surgerized tst links": recall that when…
Spectral decomposition has been rarely used to investigate complex networks. In this work we apply this concept in order to define two types of link-directed attacks while quantifying their respective effects on the topology. Several other…
The bipartition polynomial of a graph is a generalization of many other graph polynomials, including the domination, Ising, matching, independence, cut, and Euler polynomial. We show in this paper that it is also a powerful tool for proving…
Several interesting approaches have been reported in the literature on complex networks, random walks, and hierarchy of graphs. While many of these works perform random walks on stable, fixed networks, in the present work we address the…
We investigate the enumerative geometry of point configurations in projective space. We define "projective configuration counts": these enumerate configurations of points in projective space such that certain specified subsets are in fixed…
The active bijection forms a package of results studied by the authors in a series of papers in oriented matroids. The present paper is intended to state the main results in the particular case, and more widespread language, of graphs. We…
Following Penrose, we introduce a family of graph functions defined in terms of contractions of certain products of symmetric tensors along the edges of a graph. Special cases of these functions enumerate edge colorings and cycles of…
We consider drawings of graphs that contain dense subgraphs. We introduce intersection-link representations for such graphs, in which each vertex $u$ is represented by a geometric object $R(u)$ and in which each edge $(u,v)$ is represented…
We associate all small subgraph counting problems with a systematic graph encoding/representation system which makes a coherent use of graphlet structures. The system can serve as a unified foundation for studying and connecting many…
Multiscale shape skeletonization on pixel adjacency graphs is an advanced intriguing research subject in the field of image processing, computer vision and data mining. The previous works in this area almost focused on the graph vertices.…
The concept of coreflexive set is introduced to study the structure of digraphs. New characterizations of line digraphs and nth-order line digraphs are given. Coreflexive sets also lead to another natural way of forming an intersection…
We derive a one-parameter deformation of the refined topological vertex that, when used to compute non-periodic web diagrams, reproduces the six-dimensional topological string partition functions that are computed using the refined vertex…