Results 81 to 90 of about 174,868,130 (283)
Cloud-Edge Collaboration-Based Data Processing Method for Distribution Terminal Unit Edge Clusters
EnergiesDistribution terminal units (DTUs) play critical roles in smart grid for supporting data acquisition, remote monitoring, and fault management. A single DTU generates continuous data streams, imposing new challenges on data processing.
Ruijiang Zeng +4 more
doaj +1 more source
An Extension of Kotzig’s Theorem
Discussiones Mathematicae Graph Theory, 2016 In 1955, Kotzig proved that every 3-connected planar graph has an edge with the degree sum of its end vertices at most 13, which is tight. An edge uv is of type (i, j) if d(u) ≤ i and d(v) ≤ j.
Aksenov Valerii A. +2 more
doaj +1 more source
On Conditional Connectivity of the Cartesian Product of Cycles
Discussiones Mathematicae Graph Theory, 2023 The conditional h-vertex (h-edge) connectivity of a connected graph H of minimum degree k > h is the size of a smallest vertex (edge) set F of H such that H − F is a disconnected graph of minimum degree at least h. Let G be the Cartesian product of r ≥ 1
Saraf J.B., Borse Y.M., Mundhe Ganesh
doaj +1 more source
FEBS Letters, EarlyView.CT10 regulator of kinase (CRK) and CRK‐Like (CRKL) are signaling adaptors driving cell adhesion, motility, differentiation, and proliferation. SH2‐domain containing (SH) proteins are enriched in YXXP motifs which when phosphorylated create preferred binding sites for CRK family SH2 domains.
Phoebe M. Cousens +8 more
wiley +1 more source
Sufficient conditions for maximally edge-connected and super-edge-connected graphs
Communications in Combinatorics and Optimization, 2017 Let $G$ be a connected graph with minimum degree $\delta$ and edge-connectivity $\lambda$. A graph is maximally edge-connected if $\lambda=\delta$, and it is super-edge-connected if every minimum edge-cut is trivial; that is, if every ...
Lutz Volkmann, Zhen-Mu Hong
doaj +1 more source
Forbidden Subgraphs for Collapsible Graphs and Supereulerian Graphs
Discussiones Mathematicae Graph Theory, 2022 In this paper, we completely characterize the connected forbidden subgraphs and pairs of connected forbidden subgraphs that force a 2-edge-connected (2-connected) graph to be collapsible.
Liu Xia, Xiong Liming
doaj +1 more source
Edge coloring of graphs with small maximum degrees
Discrete Mathematics, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Shuchao Li, Xuechao Li
openaire +1 more source
Distributed Degree Splitting, Edge Coloring, and Orientations [PDF]
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017 We study a family of closely-related distributed graph problems, which we call degree splitting, where roughly speaking the objective is to partition (or orient) the edges such that each node's degree is split almost uniformly. Our findings lead to answers for a number of problems, a sampling of which includes: -- We present a $poly(\log n)$ round ...
Mohsen Ghaffari 0001, Hsin-Hao Su
openaire +3 more sources
Investigating transcription factor dynamics in health and disease using FRAP
FEBS Letters, EarlyView.FRAP analysis of GFP‐tagged transcription factors reveals how molecular mobility and target engagement change in response to drug treatment. By combining live‐cell imaging, quantitative model fitting, and statistical analysis, this approach uncovers transcription factor dynamics linked to disease mechanisms, providing a powerful framework for ...
Kannan Govindaraj +3 more
wiley +1 more source
Structure‐forward targeting of claudins with synthetic binders
FEBS Letters, EarlyView.Claudins form the paracellular barriers between epithelial and endothelial tissues at tight junctions and are targets for molecular binders with the goal of modulating barrier permeability. Claudin‐binding molecules are relevant in drug delivery or in altering claudin interactions with disease‐causing proteins.
Alex J. Vecchio
wiley +1 more source