Results 61 to 70 of about 157 (120)

On the Minimum Number of Spanning Trees in Cubic Multigraphs

Discussiones Mathematicae Graph Theory, 2020
Let G2n, H2n be two non-isomorphic connected cubic multigraphs of order 2n with parallel edges permitted but without loops. Let t(G2n), t (H2n) denote the number of spanning trees in G2n, H2n, respectively. We prove that for n ≥ 3 there is the unique G2n
Bogdanowicz Zbigniew R.
doaj   +1 more source

On the multiplicative sum Zagreb index of molecular graphs

Open Mathematics
Multiplicative 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

Note On The Game Colouring Number Of Powers Of Graphs

Discussiones Mathematicae Graph Theory, 2016
We generalize the methods of Esperet and Zhu [6] providing an upper bound for the game colouring number of squares of graphs to obtain upper bounds for the game colouring number of m-th powers of graphs, m ≥ 3, which rely on the maximum degree and the ...
Andres Stephan Dominique, Theuser Andrea
doaj   +1 more source

Exact solutions and bounds for network SIR and SEIR models using a rooted-tree approximation. [PDF]

J Math Biol, 2023
Hall CL, Siebert BA.
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, Henning Michael A., Topp Jerzy   +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

Arankings of Trees

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, Bhaskar A, Disanto F, Rosenberg NA.   +3 more
europepmc   +1 more source

On the Colijn-Plazzotta numbering scheme for unlabeled binary rooted trees. [PDF]

Discrete Appl Math, 2021
Rosenberg NA.
europepmc   +1 more source