Results 111 to 120 of about 193 (154)
Intersections of Randomly Embedded Sparse Graphs are Poisson
, 1999 Suppose that t 2 is an integer, and randomly label t graphs with the integers 1 : : : n. We give sufficient conditions for the number of edges common to all t of the labelings to be asymptotically Poisson as n ! 1. We show by example that our theorem is,
Edward A. Bender, E. Rodney Canfield
core
Categorification of Hopf algebras of rooted trees
Open Mathematics, 2013 Kock Joachim
doaj +1 more source
Spanning Star Trees In Regular Graphs
For a subset W of vertices of an undirected graph G, let S(W ) be the subgraph consisting of W , all edges incident to at least one vertex in W , and all vertices adjacent to at least one vertex in W . If S(W ) is a tree containing all the vertices of G,
Jerrold W. Grossman
core
Admissions to intensive cardiac care units in France in 2014: A cross-sectional, nationwide population-based study. [PDF]
Medicine (Baltimore), 2018 Mercier G +9 more
europepmc +1 more source
Lower bounds on trees and unicyclic graphs with respect to the misbalance rodeg index. [PDF]
HeliyonDehgardi N, Azari M, Shang Y.
europepmc +1 more source
EXTREME VALUES OF THE FIEDLER VECTOR ON TREES. [PDF]
Linear Algebra ApplLederman RR, Steinerberger S.
europepmc +1 more source
Comparing the excepted values of atom-bond connectivity and geometric-arithmetic indices in random spiro chains. [PDF]
J Inequal Appl, 2018 Wei S, Ke X, Hao G.
europepmc +1 more source
Vector Encoding of Phylogenetic Trees by Ordered Leaf Attachment. [PDF]
Bull Math BiolRichman DH, Zhang C, Matsen FA.
europepmc +1 more source
On the range of lattice models in high dimensions. [PDF]
Probab Theory Relat Fields, 2020 Holmes M, Perkins E.
europepmc +1 more source
Random Zero-Sum Dynamic Games on Infinite Directed Graphs. [PDF]
Dyn Games ApplAttia L +4 more
europepmc +1 more source