Results 31 to 40 of about 2,132,960 (297)
Colourings of (k-r,k)-trees [PDF]
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
The Turán Number of the Graph 2P5
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
Synoptic assessment has gained prominence in higher education as a way to bridge fragmented curricula by enabling students to synthesize knowledge across modules. However, structural integration through assessment does not automatically produce authentic
David Tree, Nicholas Worsfold
doaj +1 more source
Quasi-Tree Graphs With Extremal General Multiplicative Zagreb Indices
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
Reconstructing enzyme evolution by protein engineering
Natural enzyme evolution can be retraced by protein engineering methods such as directed evolution, rational design, and ancestral sequence reconstruction. These approaches reveal how enzymes emerged from ligand‐binding scaffolds, developed varying substrate preferences, formed oligomeric complexes, adapted to environmental changes, and evolved novel ...
Lukas Drexler +2 more
wiley +1 more source
On the Strong Secure Domination Number of a Graph
In this paper, we characterize trees with a strong secure domination number less than or equal to 4 and compute this parameter for certain classes of graphs.
Turki Alsuraiheed +3 more
doaj +1 more source
Weakly connected domination critical graphs [PDF]
A dominating set \(D \subset V(G)\) is a weakly connected dominating set in \(G\) if the subgraph \(G[D]_w = (N_{G}[D],E_w)\) weakly induced by \(D\) is connected, where \(E_w\) is the set of all edges with at least one vertex in \(D\).
Magdalena Lemańska, Agnieszka Patyk
doaj
‘The Beckoning Obstruction’: On the theme of scarcity in the poetry of Peter Larkin
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
Rowan Tree Church Annual Report, 1993 [PDF]
This digital asset was created from the original digital scans by Rev. Paul V. Beyerl and provided to the Valdosta State University, Archives & Special Collections to be part of their Rowan Tree Church Periodicals Collection of the New Age Movements ...
Rowan Tree Church
core
Tumour heterogeneity and clonal evolution of metastatic salivary gland cancer were evaluated in two patients with adenoid carcinoma and one patient with myoepithelial carcinoma. Radiology‐guided autopsy enabled multi‐region sampling (total samples n = 149), followed by whole‐genome sequencing and phylogenetic reconstruction (17 tumour samples, 4–7 per ...
Gerben Lassche +10 more
wiley +1 more source

