Results 91 to 100 of about 197 (156)
Dominating Sets Whose Closed Stars Form Spanning Trees
, 1995 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 .
Jerrold W. Grossman
core
Inducibility of topological trees
, 2019 Trees without vertices of degree 2 are sometimes named topological trees. In this work, we bring forward the study of the inducibility of (rooted) topological trees with a given number of leaves.
Dossou-Olory, Audace A.V. +1 more
core
Boundary behaviour of λ -polyharmonic functions on regular trees. [PDF]
Ann Mat Pura Appl, 2021 Sava-Huss E, Woess W.
europepmc +1 more source
A combinatorial identity for rooted labeled forests. [PDF]
Aequ Math, 2020 Hackl B.
europepmc +1 more source
The Isomorphism Problem for Catalan Families
, 1995 : Given two sets of configurations S and T (defined by some geometric or algebraic rules) with weightfunctions !S : S ! IIN and ! T : T ! IIN respectively. Suppose S and T are equipotent, i.e. j! \Gamma1 S (n)j = j!
To Prof +3 more
core
A Note on Major Sequences and External Activity in Trees
, 1996 A bijection is given from major sequences of length n (a variant of parking functions) to trees on f0; : : : ; ng that maps a sequence with sum \Gamma n+1 2 \Delta + k to a tree with external activity k. Key Words: Major sequence, external activity,
Janet S. Beissinger, Uri N. Peled
core
Ramsey Goodness of Bounded Degree Trees
, 2018 Given a pair of graphs G and H, the Ramsey number R(G, H) is the smallest N such that every red-blue coloring of the edges of the complete graph KN contains a red copy of G or a blue copy of H.
Pokrovskiy, A, Balla, I, Sudakov, B
core
The hybrid number of a ploidy profile. [PDF]
J Math Biol, 2022 Huber KT, Maher LJ.
europepmc +1 more source
Ramsey-Type Results for Oriented Trees
, 2007 . For a graph G and a digraph ~ H, we write G! ~ H (respectively, G a ! ~ H) if every orientation (respectively, acyclic orientation) of the edges of G results in an induced copy of ~ H. In this note we study how small the graphs G such that G!
Vojtech Rödl +2 more
core
Enumeration of coalescent histories for caterpillar species trees and p-pseudocaterpillar gene trees. [PDF]
Adv Appl Math, 2021 Alimpiev E, Rosenberg NA.
europepmc +1 more source