相关论文: A Blass-Sagan bijection on Eulerian equivalence cl…

We consider the minimum spanning tree problem on a weighted complete bipartite graph $K_{n_R, n_B}$ whose $n=n_R+n_B$ vertices are random, i.i.d. uniformly distributed points in the unit cube in $d$ dimensions and edge weights are the…

A class of graphs is bridge-addable if given a graph $G$ in the class, any graph obtained by adding an edge between two connected components of $G$ is also in the class. We prove a conjecture of McDiarmid, Steger, and Welsh, that says that…

We construct a sequence of finite graphs that weakly converge to a Cayley graph, but there is no labelling of the edges that would converge to the corresponding Cayley diagram. A similar construction is used to give graph sequences that…

This article presents a unified bijective scheme between planar maps and blossoming trees, where a blossoming tree is defined as a spanning tree of the map decorated with some dangling half-edges that enable to reconstruct its faces. Our…

For a weighted graph $G = (V, E, w)$ and a designated source vertex $s \in V$, a spanning tree that simultaneously approximates a shortest-path tree w.r.t. source $s$ and a minimum spanning tree is called a shallow-light tree (SLT).…

Recently, Milani\v{c} and Trotignon introduced the class of equistarable graphs as graphs without isolated vertices admitting positive weights on the edges such that a subset of edges is of total weight $1$ if and only if it forms a maximal…

We present bijections enumerating (k,m)-trees, k-gon trees, edge labelled (2,1)-trees, and other tree-like structures. Our constructions are based on Foata's (1971) bijection for cycle-free functions, which is simplified here.

In this paper we build a bijection between the meet-irreducible elements of the lattice of the compositions of $n$ with parts in $[1,p]$ equipped with the dominance order, and the edges of the $(n,p)$-Tur\'an graph. Using this bijection, we…

We obtain the maximum sum-connectivity indices of graphs in the set of trees and in the set of unicyclic graphs respectively with given number of vertices and maximum degree, and determine the corresponding extremal graphs. Additionally, we…

We consider the conformal gauging of non-abelian groups. In such cases there are inequivalent ways of gauging (generalizing the axial and vector cases for abelian groups) corresponding to external automorphisms of the group. Different…

The ability to compare complex systems can provide new insight into the fundamental nature of the processes captured in ways that are otherwise inaccessible to observation. Here, we introduce the $n$-tangle method to directly compare two…

We introduce linear Dirac and generalized complex structures on Cartan geometries and give criteria for Dirac subalgebras of $\frkg\ltimes\frkg^*$ representing Dirac structures on a Cartan geometry. We prove that there is a bijection…

We make connections of a counting problem of Eulerian cycles for undirected graphs to homological spectral graph theory, and formulate explicitly a trace formula that identifies the number of Eulerian circuits on an Eulerian graph with the…

The complexity of a graph is the number of its labeled spanning trees. It is demonstrated that the seven known triangle-free strongly regular graphs, such as the Higman-Sims graph, are graphs of maximal complexity among all graphs of the…

To a rational homology sphere graph manifold one can associate a weighted tree invariant called splice diagram. It was shown earlier that the splice diagram determines the universal abelian cover of the manifold. We will in this article…

We propose a method to identify nonlinear acyclic networks in continuous time when the dynamics are located on the edges and all the nodes are excited. We show that it is necessary and sufficient to measure all the sinks to identify any…

For a directed graph G on vertices {0,1,...,n}, a G-parking function is an n-tuple (b_1,...,b_n) of non-negative integers such that, for every non-empty subset U of {1,...,n}, there exists a vertex j in U for which there are more than b_j…

In this article, Temperley's bijection between spanning trees of the square grid on the one hand, and perfect matchings (also known as dimer coverings) of the square grid on the other, is extended to the setting of general planar directed…

The Jacobian group ${\rm Jac}(G)$ of a finite graph $G$ is a group whose cardinality is the number of spanning trees of $G$. $G$ also has a tropical Jacobian which has the structure of a real torus; using the notion of break divisors, An et…

Full Bayesian computational inference for model determination in undirected graphical models is currently restricted to decomposable graphs, except for problems of very small scale. In this paper we develop new, more efficient methodology…