Results 111 to 120 of about 197 (156)
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
Categorification of Hopf algebras of rooted trees
Kock Joachim
doaj +1 more source
Admissions to intensive cardiac care units in France in 2014: A cross-sectional, nationwide population-based study. [PDF]
Mercier G +9 more
europepmc +1 more source
Lower bounds on trees and unicyclic graphs with respect to the misbalance rodeg index. [PDF]
Dehgardi N, Azari M, Shang Y.
europepmc +1 more source
EXTREME VALUES OF THE FIEDLER VECTOR ON TREES. [PDF]
Lederman RR, Steinerberger S.
europepmc +1 more source
Comparing the excepted values of atom-bond connectivity and geometric-arithmetic indices in random spiro chains. [PDF]
Wei S, Ke X, Hao G.
europepmc +1 more source
Vector Encoding of Phylogenetic Trees by Ordered Leaf Attachment. [PDF]
Richman DH, Zhang C, Matsen FA.
europepmc +1 more source
On the range of lattice models in high dimensions. [PDF]
Holmes M, Perkins E.
europepmc +1 more source
Random Zero-Sum Dynamic Games on Infinite Directed Graphs. [PDF]
Attia L +4 more
europepmc +1 more source
Distance-based topological polynomials and indices of friendship graphs. [PDF]
Gao W +3 more
europepmc +1 more source

