Results 81 to 90 of about 1,401 (109)
A combinatorial identity for rooted labeled forests. [PDF]
Aequ Math, 2020 Hackl B.
europepmc +1 more source
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 hybrid number of a ploidy profile. [PDF]
J Math Biol, 2022 Huber KT, Maher LJ.
europepmc +1 more source
On the multiplicative sum Zagreb index of molecular graphs
Open MathematicsMultiplicative sum Zagreb index is a modified version of the famous Zagreb indices. For a graph GG, the multiplicative sum Zagreb index is defined as Π1*(G)=∏uv∈E(G)(dG(u)+dG(v)){\Pi }_{1}^{* }\left(G)={\prod }_{uv\in E\left(G)}\left({d}_{G}\left(u)+{d}_{
Sun Xiaoling, Du Jianwei, Mei Yinzhen
doaj +1 more source
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
An efficient characterization of submodular spanning tree games. [PDF]
Math Program, 2020 Koh ZK, Sanità L.
europepmc +1 more source
Distinguishing level-1 phylogenetic networks on the basis of data generated by Markov processes. [PDF]
J Math Biol, 2021 Gross E +5 more
europepmc +1 more source
The rigid hybrid number for two phylogenetic trees. [PDF]
J Math Biol, 2021 Huber KT, Linz S, Moulton V.
europepmc +1 more source
Complexity of graphs generated by wheel graph and their asymptotic limits
Journal of the Egyptian Mathematical Society, 2017 The literature is very rich with works deal with the enumerating the spanning trees in any graph G since the pioneer Kirchhoff (1847). Generally, the number of spanning trees in a graph can be acquired by directly calculating an associated determinant ...
S.N. Daoud
doaj
(In)dependence of the axioms of Λ-trees
Analysis and Geometry in Metric SpacesA Λ\Lambda -tree is a Λ\Lambda -metric space satisfying three axioms (1), (2), and (3). We give a characterization of those ordered abelian groups Λ\Lambda for which axioms (1) and (2) imply axiom (3).
Appenzeller Raphael
doaj +1 more source