Results 71 to 80 of about 54,765 (253)
γ-Cycles And Transitivity By Monochromatic Paths In Arc-Coloured Digraphs
Discussiones Mathematicae Graph Theory, 2013 We call the digraph D an m-coloured digraph if its arcs are coloured with m colours. If D is an m-coloured digraph and a ∈ A(D), colour(a) will denote the colour has been used on a.
Casas-Bautista Enrique +2 more
doaj +1 more source
Using fluorescence fluctuation spectroscopy to quantify molecular dynamics within cells
FEBS Open Bio, EarlyView.Microscopy techniques like fluorescence correlation spectroscopy (FCS) and number and brightness analysis (N&B) allow to quantify concentrations, diffusion rates, and oligomerization of fluorescently labeled molecules in the living cell. In this protocol the principles of how to set up these types of experiments are described including calibration ...
Mark A. Hink
wiley +1 more source
Analysis of Known Linear Distributed Average Consensus Algorithms on Cycles and Paths
Sensors, 2018 In this paper, we compare six known linear distributed average consensus algorithms on a sensor network in terms of convergence time (and therefore, in terms of the number of transmissions required).
Jesús Gutiérrez-Gutiérrez +2 more
doaj +1 more source
A nationwide student survey on biochemistry learning resources in Italy
FEBS Open Bio, EarlyView.We conducted a survey among Italian university students to investigate their preferred study materials for biochemistry. We then analyzed the collected data to identify these materials. This information may be valuable to the Biochemistry educational community. The graphical abstract was created with Claude (Opus 5.5; Anthropic, 2026).
Anna Marabotti +4 more
wiley +1 more source
Paths, Trees and Cycles in Tournaments
, 2008 We survey results on paths, trees and cycles in tournaments. The main subjects are hamiltonian paths and cycles, vertex and arc disjoint paths with prescribed endvertices, arc-pancyclicity, oriented paths, trees and cycles in tournaments.
Jørgen Bang-Jensen, Gregory Gutin
core
Counting Arithmetical Structures on Paths and Cycles [PDF]
, 2018 Let G be a finite, connected graph. An arithmetical structure on G is a pair of positive integer vectors d, r such that (diag (d) - A) r=0 , where A is the adjacency matrix of G.
Corrales, Hugo +10 more
core +1 more source
Global Rather Than Vertical‐Selective Saccadic Abnormalities in Progressive Supranuclear Palsy
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Objective To test whether vertical saccades are preferentially affected in Progressive Supranuclear Palsy (PSP). Methods PSP patients (n = 24) were compared to age‐matched controls (n = 94) and two degenerative groups (Alzheimer's disease, n = 20; Lewy body disease, n = 50).
Duy Duan Nguyen +6 more
wiley +1 more source
Extending partial edge colorings of iterated cartesian products of cycles and paths [PDF]
Discrete Mathematics & Theoretical Computer ScienceWe consider the problem of extending partial edge colorings of iterated cartesian products of even cycles and paths, focusing on the case when the precolored edges satisfy either an Evans-type condition or is a matching.
Carl Johan Casselgren +2 more
doaj +1 more source
Advanced Engineering Materials, EarlyView.Low‐cycle fatigue damage in Mn–Mo–Ni reactor pressure vessel steel is examined using a combined electron backscatter diffraction and positron annihilation lifetime spectroscopy approach. The study correlates texture evolution, dislocation substructure development, and vacancy‐type defect formation across uniform, necked, and fracture regions, providing
Apu Sarkar +2 more
wiley +1 more source
Italian Domination Number for Strong Product of Cycles and Paths
Journal of MathematicsThis paper mainly considers the Italian domination number for strong product of cycles and paths. After constructing some recursive Italian dominating functions, we derive the upper bounds for the Italian domination number of strong product of cycles and
Liyang Wei, Feng Li
doaj +1 more source