Results 51 to 60 of about 407,618 (322)
Γ-independent dominating graphs of paths and cycles [PDF]
Songklanakarin Journal of Science and Technology (SJST)A set D of vertices in a graph G is an independent dominating set if D is a set of pairwise nonadjacent vertices of G such that every vertex of G not in D is adjacent to at least one vertex in D.
Roongrat Samanmoo +1 more
doaj
Simple Paths and Cycles of Directed Graph for Stock Trading Network Based on STP
Journal of Mathematics, 2022 The stock trading relationship of buyers and sellers in the stock market can be characterized by a directed graph. It is an important way to study stock trading network through simple directed paths and cycles.
Xiaolong Liu, Li Ma
doaj +1 more source
FEBS Open Bio, EarlyView.What factors make for an effective digital learning tool in Higher Education? This systematic review identifies elements of a digital tool that published examples reveal to be features of an engaging and impactful digital tool. A systematic literature search yielded 25 research papers for analysis.
Akmal Arzeman +4 more
wiley +1 more source
Frontiers in Bioengineering and Biotechnology, 2022 To disclose the net effect of light on microalgal growth in photobioreactors, self-shading and mixing-induced light–dark cycles must be minimized and discerned from the transient phenomena of acclimation.
Alberto Saccardo +3 more
doaj +1 more source
Raman‐based label‐free microscopic analysis of the pancreas in living zebrafish larvae
FEBS Open Bio, EarlyView.Forward stimulated Raman scattering (F‐SRS) and epi coherent anti‐Stokes Raman scattering (E‐CARS) allow label‐free discrimination of distinct subcellular structures in the pancreas of living zebrafish larvae. Given the straightforward applicability, we anticipate broad implementation of Raman microscopy in other organs and across various biomedical ...
Noura Faraj +3 more
wiley +1 more source
Edge ideals and DG algebra resolutions
Le Matematiche, 2015 Let R = S/I where S = k[T_1, . . . , T_n] and I is a homogeneous ideal in S. The acyclic closure R<Y> of k over R is a DG algebra resolution obtained by means of Tate’s process of adjoining variables to kill cycles.
Adam Boocher +4 more
doaj
On size multipartite Ramsey numbers for stars versus paths and cycles
Electronic Journal of Graph Theory and Applications, 2017 Let $K_{l\times t}$ be a complete, balanced, multipartite graph consisting of $l$ partite sets and $t$ vertices in each partite set. For given two graphs $G_1$ and $G_2$, and integer $j\geq 2$, the size multipartite Ramsey number $m_j(G_1,G_2)$ is the ...
Anie Lusiani +2 more
doaj +1 more source
Data Parallel Multi‐GPU Path Tracing using Ray Queue Cycling [PDF]
, 2023 Ingo Wald, M. Jaroš, Stefan Zellmann
openalex +1 more source
Enzymatic degradation of biopolymers in amorphous and molten states: mechanisms and applications
FEBS Open Bio, EarlyView.This review explains how polymer morphology and thermal state shape enzymatic degradation pathways, comparing amorphous and molten biopolymer structures. By integrating structure–reactivity principles with insights from thermodynamics and enzyme engineering, it highlights mechanisms that enable efficient polymer breakdown.
Anđela Pustak, Aleksandra Maršavelski
wiley +1 more source
FEBS Open Bio, EarlyView.This review provides an overview of bio‐based polymer sources, their unique functional properties and their environmental impact, and addresses their role as sustainable alternatives. It discusses end‐of‐life options, including composting and anaerobic digestion for renewable energy.
Sabina Kolbl Repinc +8 more
wiley +1 more source