scientific article; zbMATH DE number 3340110

Cited in

(only showing first 100 items - show all)

Series expansion of the percolation threshold on hypercubic lattices
Simplicial matrix-tree theorems
Stability of a stochastic one-predator-two-prey population model with time delays
Trees, forests, and total positivity. I: \(q\)-trees and \(q\)-forests matrices
Multichains, non-crossing partitions and trees
Subjectively interesting connecting trees and forests
Spanning trees in random series-parallel graphs
Counting finite models
Enumeration of meanders and Masur-Veech volumes
Linear algebraic techniques for weighted spanning tree enumeration
Epidemic models with discrete state structures
Habitat fragmentation promotes malaria persistence
Tree codes that preserve increases and degree sequences
On the expected number of edges in a maximum matching of an (r,s)-tree
Disease invasion on community networks with environmental pathogen movement
Random graphs from a weighted minor-closed class
Dynamics of a two-predator one-prey stochastic delay model with Lévy noise
A new bijection on rooted forests
Subgraph counts for dense random graphs with specified degrees
On the number of spanning trees in random regular graphs
Laplacian dynamics on general graphs
Computing Prüfer codes efficiently in parallel
Principles of cost minimisation in wireless networks
Counting spanning trees in almost complete multipartite graphs
Brussels sprouts, noncrossing trees, and parking functions
On combinatorial testing problems
Pendant appearances and components in random graphs from structured classes
Tail bounds for the height and width of a random tree with a given degree sequence
Bijective linear time coding and decoding for \(k\)-trees
The average number of spanning hypertrees in sparse uniform hypergraphs
Global dynamics of a network epidemic model for waterborne diseases spread
On the dynamics of a class of multi-group models for vector-borne diseases
The almost sure stability of coupled system of stochastic delay differential equations on networks
The average number of spanning trees in sparse graphs with given degrees
Computation of the expected number of leaves in a tree having a given automorphism, and related topics
Une nouvelle demonstration combinatoire des formules d'inversion de Lagrange
Spanning trees in random regular uniform hypergraphs
Analysis of autonomous Lotka-Volterra competition systems with random perturbation
Spanning trees of dense directed graphs
Maximum induced trees in sparse random graphs
Delay-dependent synchronization of Lévy noise coupled systems with application to Chua's circuits
An enumeration of distinct and non-isomorphic functional quasi-order relations
Connectivity for bridge-alterable graph classes
Epidemic model with group mixing: stability and optimal control based on limited vaccination resources
Asymptotic enumeration of orientations of a graph as a function of the out-degree sequence
A variant of the Teufl-Wagner formula and applications
Ascents and descents in random trees
Dynamical analysis of a fractional SIR model with birth and death on heterogeneous complex networks
Global stability analysis with a discretization approach for an age-structured multigroup SIR epidemic model
The sum of edge lengths in random linear arrangements
Spanning trees: A survey
Global stability of multi-group epidemic models with distributed delays
Compartmental disease models with heterogeneous populations: a survey
Enumerating alternating trees
The number of \((d,k)\)-hypertrees
Applications of antilexicographic order. I: An enumerative theory of trees
Factorizations of some weighted spanning tree enumerators
Isolating the most recent entry in a random recursive tree by random cuts
Two bijective proofs for the arborescent form of the Good-Lagrange formula and some applications to colored rooted trees and cacti
Modeling the impacts of awareness and limited medical resources on the epidemic size of a multi-group SIR epidemic model
scientific article; zbMATH DE number 7771742 (Why is no real title available?)
Counting colorful multi-dimensional trees
Cluster and virial expansions for the multi-species Tonks gas
Invasion percolation on the Poisson-weighted infinite tree
Global-stability problem for coupled systems of differential equations on networks
A duality for labeled graphs and factorizations with applications to graph embeddings and Hurwitz enumeration
A coding algorithm for Rényi trees
Dynamical behavior of a one-prey two-predator model with random perturbations
A weighted cellular matrix-tree theorem, with applications to complete colorful and cubical complexes
A Random Graph With a Subcritical Number of Edges
On one approach to enumeration of labeled connected graphs: a review
On Operator and Formal Sum Methods for Graph Enumeration Problems
The \(r\)-Stirling numbers
A remark on the enumeration of rooted labeled trees
On coding labeled trees
Bandwidths and profiles of trees
The component counts of random functions
Counting complements in the partition lattice, and hypertrees
Cayley's formula for multidimensional trees
The road-colouring problem
On Cayley's formula for counting forests
Fast random generation of binary, t-ary and other types of trees
Impact of Varying Community Networks on Disease Invasion
Parking functions and tree inversions revisited
On random mapping patterns
Additive representation of symmetric inverse M-matrices and potentials
Spanning trees of descendants of a complete graph
On minimum generalized degree distance index of cyclic graphs
Spanning tree formulas and Chebyshev polynomials
The Fibonacci numbers via trigonometric expressions
Enumeration of (uni- or bicolored) plane trees according to their degree distribution
On the largest component of the random graph at a nearcritical stage
Tree and forest weights and their application to nonuniform random graphs
The number of trees with a 1-factor
On the number of trees in a random forest
On constructing rational spanning tree edge densities
Analysis of a stochastic tri-trophic food-chain model with harvesting
Distribution of tree parameters by martingale approach
On the asymptotic behavior of the independence number of a random (n,n)-tree
Partial difference equations in m₁ m₂ m_n 0 and their applications to combinatorics

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5616724)