相关论文: On the fibration of augmented link complements
A plane topological graph $G=(V,E)$ is a graph drawn in the plane whose vertices are points in the plane and whose edges are simple curves that do not intersect, except at their endpoints. Given a plane topological graph $G=(V,E)$ and a set…
We present a link-by-link rule-based method for constructing all members of the ensemble of spanning trees for any recursively generated, finitely articulated graph, such as the DGM net. The recursions allow for many large-scale properties…
Recent progress towards unraveling the hidden geometric organization of real multiplexes revealed significant correlations across the hyperbolic node coordinates in different network layers, which facilitated applications like trans-layer…
We study the emergence of coherence in complex networks of mutually coupled non-identical elements. We uncover the precise dependence of the dynamical coherence on the network connectivity, on the isolated dynamics of the elements and the…
Phylogenetic networks are a generalization of phylogenetic trees that are used to represent non-tree-like evolutionary histories that arise in organisms such as plants and bacteria, or uncertainty in evolutionary histories. An…
The relations, rather than the elements, constitute the structure of networks. We therefore develop a systematic approach to the analysis of networks, modelled as graphs or hypergraphs, that is based on structural properties of…
We give a proof for sharp estimate for the number of spanning trees using linear algebra and generalize this bound to multigraphs. In addition, we show that this bound is tight for complete graphs. In addition, we give estimates for number…
We present a simple iterative strategy for measuring the connection strength between a pair of vertices in a graph. The method is attractive in that it has a linear complexity and can be easily parallelized. Based on an analysis of the…
Graphs on integer points of polytopes whose edges come from a set of allowed differences are studied. It is shown that any simple graph can be embedded in that way. The minimal dimension of such a representation is the fiber dimension of…
The existence of basket, flat plumbing and flat plumbing basket surfaces of a link was first proven from a braid representative of the link. In the present article, we show the existence of such surfaces from an induced graph of the link.…
We introduce and solve a model which considers two coupled networks growing simultaneously. The dynamics of the networks is governed by the new arrival of network elements (nodes) making preferential attachments to pre-existing nodes in…
In this paper, we study the hyperbolicity of arborescent tangles and arborescent links. We will explicitly determine all essential surfaces in arborescent tangle complements with non-negative Euler characteristic, and show that given an…
A graph is path-pairable if for any pairing of its vertices there exist edge-disjoint paths joining the vertices in each pair. We investigate the behaviour of the maximum degree in path-pairable planar graphs. We show that any $n$-vertex…
It is shown that any handle-irreducible summand of every stable-ribbon surface-link is a unique ribbon surface-link up to equivalences, so that every stable-ribbon surface-link is a ribbon surface-link. This is a generalization of a…
Data describing the three-dimensional structure of physical networks is increasingly available, leading to a surge of interest in network science to explore the relationship between the shape and connectivity of physical networks. We…
We prove that for any positive integer $k$, the edges of any graph whose fractional arboricity is at most $k + 1/(3k+2)$ can be decomposed into $k$ forests and a matching.
Graphs with bounded treewidth and bounded maximum degree are known to have tree-partitions of bounded width. What can be said if the bounded treewidth assumption is strengthened to bounded pathwidth? We prove that every graph with bounded…
We consider vector fields on knot/link complements in $S^3$ which are transverse to the fibres of a fibration of the complement over a circle. We prove that a large class of fibred knots/links, including all non-torus fibred 2-bridge knots,…
We investigate great circle links in the three-sphere, the class of links where each component is a great circle. Using the geometry of their complements, we classify such links up to five components. For any two-bridge knot complement,…
The recently introduced \emph{Degree Preserving Growth} model (Nature Physics, \DOI{10.1038/s41567-021-01417-7}) uses matchings to insert new vertices of prescribed degrees into the current graph of an ever-growing graph sequence. The…