Results 21 to 30 of about 1,224,461 (319)

The Turán Number of the Graph 2P5

Discussiones Mathematicae Graph Theory, 2016
We give the Turán number ex (n, 2P5) for all positive integers n, improving one of the results of Bushaw and Kettle [Turán numbers of multiple paths and equibipartite forests, Combininatorics, Probability and Computing, 20 (2011) 837-853].
Bielak Halina, Kieliszek Sebastian
doaj   +1 more source

Colourings of (k-r,k)-trees [PDF]

Opuscula Mathematica, 2017
Trees are generalized to a special kind of higher dimensional complexes known as \((j,k)\)-trees ([L. W. Beineke, R. E. Pippert, On the structure of \((m,n)\)-trees, Proc. 8th S-E Conf. Combinatorics, Graph Theory and Computing, 1977, 75-80]), and which
M. Borowiecki, H. P. Patil
doaj   +1 more source

Tree contractions and evolutionary trees [PDF]

SIAM Journal on Computing, 1997
An evolutionary tree is a rooted tree where each internal vertex has at least two children and where the leaves are labeled with distinct symbols representing species. Evolutionary trees are useful for modeling the evolutionary history of species. An agreement subtree of two evolutionary trees is an evolutionary tree which is also a topological subtree
openaire   +6 more sources

Splay trees on trees

, 2022
Search trees on trees (STTs) are a far-reaching generalization of binary search trees (BSTs), allowing the efficient exploration of tree-structured domains. (BSTs are the special case in which the underlying domain is a path.) Trees on trees have been extensively studied under various guises in computer science and discrete mathematics.
Berendsohn, Benjamin Aram, Kozma, László   +1 more
openaire   +2 more sources

Quasi-Tree Graphs With Extremal General Multiplicative Zagreb Indices

IEEE Access, 2020
Zagreb indices and their modified versions of a molecular graph are important molecular descriptors which can be applied in characterizing the structural properties of organic compounds from different aspects. In this article, by exploring the structures
Jianwei Du, Xiaoling Sun
doaj   +1 more source

Categorizing Ideas about Trees: A Tree of Trees

PLoS ONE, 2013
The aim of this study is to explore whether matrices and MP trees used to produce systematic categories of organisms could be useful to produce categories of ideas in history of science. We study the history of the use of trees in systematics to represent the diversity of life from 1766 to 1991.
Guillaume Lecointre, Marie Fisler
openaire   +5 more sources

Computing the Scale of an Endomorphism of a totally Disconnected Locally Compact Group

Axioms, 2017
The scale of an endomorphism of a totally disconnected, locally compact group G is defined and an example is presented which shows that the scale function is not always continuous with respect to the Braconnier topology on the automorphism group of G ...
George A. Willis
doaj   +1 more source

‘The Beckoning Obstruction’: On the theme of scarcity in the poetry of Peter Larkin

Journal of British and Irish Innovative Poetry, 2020
Although he writes almost exclusively about trees and one of his main themes is scarcity, Peter Larkin should not be considered only an ecological nature poet.
John Milbank
doaj   +2 more sources

Trees

Nuclear Physics B, 2016
minor corrections, references added, no change in ...
openaire   +3 more sources

Seven largest trees pack [PDF]

Opuscula Mathematica
The Tree Packing Conjecture (TPC) by Gyárfás states that any set of trees \(T_2,\dots,T_{n-1}, T_n\) such that \(T_i\) has \(i\) vertices pack into \(K_n\). The conjecture is true for bounded degree trees, but in general, it is widely open.
Maciej Cisiński, Andrzej Żak
doaj   +1 more source