Results 81 to 90 of about 197 (156)
Lower bounds on the leaf number in graphs with forbidden subgraphs
, 2017 Let G be a simple, connected graph. The leaf number, L(G) of G, is dened as the maximum number of leaf vertices contained in a spanning tree of G. Assume that G is a triangle-free graph with minimum degree δ, order n and leaf number L(G).
Rodrigues, B.G., Mukwembi, S, Munyira, S
core
On Accurate Domination in Graphs
Discussiones Mathematicae Graph Theory, 2019 A dominating set of a graph G is a subset D ⊆ VG such that every vertex not in D is adjacent to at least one vertex in D. The cardinality of a smallest dominating set of G, denoted by γ(G), is the domination number of G. The accurate domination number of
Cyman Joanna +2 more
doaj +1 more source
The expected loss of feature diversity (versus phylogenetic diversity) following rapid extinction at the present. [PDF]
J Math Biol, 2023 Overwater M, Pelletier D, Steel M.
europepmc +1 more source
On Two Generalized Connectivities of Graphs
Discussiones Mathematicae Graph Theory, 2018 The concept of generalized k-connectivity κk(G), mentioned by Hager in 1985, is a natural generalization of the path-version of the classical connectivity.
Sun Yuefang, Li Fengwei, Jin Zemin
doaj +1 more source
Discussiones Mathematicae Graph Theory, 2019 For a graph G = (V, E), a function f : V (G) → {1, 2, . . ., k} is a kranking for G if f(u) = f(v) implies that every u − v path contains a vertex w such that f(w) > f(u).
Pillone D.
doaj +1 more source
Enumeration of binary trees compatible with a perfect phylogeny. [PDF]
J Math Biol, 2022 Palacios JA +3 more
europepmc +1 more source
Symplectic Runge-Kutta Schemes III: Canonical Elementary Differentials
, 1993 . It has been shown that numerical methods for Hamiltonian systems may be characterised in terms of so-called canonical elementary differentials. Recent results by the authors demonstrate that the symplecticity condition for Runge-Kutta schemes may be ...
M. Sofroniou, W. Oevel
core
On the Colijn-Plazzotta numbering scheme for unlabeled binary rooted trees. [PDF]
Discrete Appl Math, 2021 Rosenberg NA.
europepmc +1 more source
A Linked Cluster Theorem of the Solution of the Generalized Burger Equation
, 2012 In this paper we consider a stochastic partial differential equation defined on a Lattice L δ with coefficients of non-linearity with degree p. An analytic solution in the sense of formal power series is given.
Boubaker Smii
core
Completely Independent Spanning Trees in k-Th Power of Graphs
Discussiones Mathematicae Graph Theory, 2018 Let T1, T2, . . . , Tk be spanning trees of a graph G. For any two vertices u, v of G, if the paths from u to v in these k trees are pairwise openly disjoint, then we say that T1, T2, . . . , Tk are completely independent. Araki showed that the square of
Hong Xia
doaj +1 more source