Results 71 to 80 of about 174,868,130 (283)
On Computation of Edge Degree-Based Banhatti Indices of a Certain Molecular Network
Journal of Mathematics, 2021 Chemical graph theory deals with the basic properties of a molecular graph. In graph theory, we correlate molecular descriptors to the properties of molecular structures.
Jiang-Hua Tang +6 more
doaj +1 more source
Biophysical approaches for studying viral entry
FEBS Letters, EarlyView.Viruses infect all living organisms and have been responsible for major epidemics and pandemics. Their ongoing evolutionary battle with host defenses creates a constant need for improved tools to study viral behavior. Advancing methods to probe viral attachment, fusion, and genome release deepen our understanding of how infections begin and support the
Inbar Yosibash, Raya Sorkin
wiley +1 more source
Communications in Combinatorics and Optimization, 2016 Let $D$ be a finite and simple digraph with vertex set $V(D)$. For a vertex $v\in V(D)$, the degree of $v$, denoted by $d(v)$, is defined as the minimum value of its out-degree $d^+(v)$ and its in-degree $d^-(v)$.
L. Volkmann
doaj +1 more source
Edge-decompositions of graphs with high minimum degree [PDF]
Electronic Notes in Discrete Mathematics, 2015 41 pages.
Ben Barber +3 more
openaire +7 more sources
Degradation mechanism of the von Willebrand factor A2 domain by nattokinase
FEBS Letters, EarlyView.Nattokinase, a natto‐derived protease, exhibits potent antithrombotic effects. This study demonstrates that nattokinase directly cleaves the von Willebrand factor (vWF) A2 domain in vitro. Unlike the native regulator ADAMTS13, nattokinase degrades folded vWF independently of shear stress.
Ryuichi Hyakumoto +3 more
wiley +1 more source
The minimum restricted edge-connected graph and the minimum size of graphs with a given edge–degree
, 2014 International audienceLet $G=(V(G),E(G))$ be a graph. Determining the minimum and/or maximum size $(|E(G)|)$ of graphs with some given parameters is a classic extremal problem in graph theory. For a graph $G$ and $e=uv∈E(G)$, we denote $d(e)=d(u)+d(v)−2$
Li, Hengzhe +4 more
core +1 more source
FEBS Letters, EarlyView.We present robust protocols for the preparation of supported lipid bilayers (SLBs) incorporating either Salmonella smooth LPS or outer membrane vesicles (OMVs). We use a combination of quartz crystal microbalance with dissipation (QCM‐D) and fluorescence microscopy to both characterize the SLBs of various compositions and to probe their interactions ...
Hudson P. Pace +6 more
wiley +1 more source
Edge Degree Weight of Sequential Join of Graphs
Science Journal of University of Zakho, 2013 Let the weight w of an edge e= uv={u,v} of a graph G be defined by w(e)=deg(u)+deg(v)-2 and the weight of G be defined by w(G)= ∑ e ∈ E(G)w(e), where E(G) is the edge set of G.
Khidir R. Sharaf, Didar A. Ali
doaj
Computing Severi degrees with long-edge graphs [PDF]
Bulletin of the Brazilian Mathematical Society, New Series, 2014 We study a class of graphs with finitely many edges in order to understand the nature of the formal logarithm of the generating series for Severi degrees in elementary combinatorial terms. These graphs are related to floor diagrams associated to plane tropical curves originally developed by Brugalle and Mikhalkin, and used by Block, Fomin, and ...
Block, Florian +2 more
openaire +3 more sources
From mice to humans—divergent strategies for intestinal homeostasis and regeneration
FEBS Letters, EarlyView.Recent advances such as organoid genome editing, xenotransplantation, imaging, and whole‐genome sequencing have enabled direct studies of human intestinal stem cells (ISCs). These studies reveal species‐specific features, including slower ISC proliferation, distinct injury responses, slower somatic mutation accumulation in humans, and an inverse ...
Keiko Ishikawa +2 more
wiley +1 more source