Results 51 to 60 of about 448,626 (277)

Spreading in claw-free cubic graphs [PDF]

open access: yesOpuscula Mathematica
Let \(p \in \mathbb{N}\) and \(q \in \mathbb{N} \cup \lbrace \infty \rbrace\). We study a dynamic coloring of the vertices of a graph \(G\) that starts with an initial subset \(S\) of blue vertices, with all remaining vertices colored white.
Boštjan Brešar   +2 more
doaj   +1 more source

Asymmetric motion in a double-well under the action of zero-mean Gaussian white noise and periodic forcing

open access: yes, 1997
Residence times of a particle in both the wells of a double-well system, under the action of zero-mean Gaussian white noise and zero-averaged but temporally asymmetric periodic forcings, are recorded in a numerical simulation.
A. Ajdari   +20 more
core   +1 more source

Structural instability impairs function of the UDP‐xylose synthase 1 Ile181Asn variant associated with short‐stature genetic syndrome in humans

open access: yesFEBS Letters, EarlyView.
The Ile181Asn variant of human UDP‐xylose synthase (hUXS1), associated with a short‐stature genetic syndrome, has previously been reported as inactive. Our findings demonstrate that Ile181Asn‐hUXS1 retains catalytic activity similar to the wild‐type but exhibits reduced stability, a looser oligomeric state, and an increased tendency to precipitate ...
Tuo Li   +2 more
wiley   +1 more source

Upper bounds on the k-forcing number of a graph [PDF]

open access: yes, 2014
Given a simple undirected graph $G$ and a positive integer $k$, the $k$-forcing number of $G$, denoted $F_k(G)$, is the minimum number of vertices that need to be initially colored so that all vertices eventually become colored during the discrete ...
Amos, David   +3 more
core  

Partial Zero-Forcing for Multi-Way Relay Networks

open access: yes, 2018
The ever increasing demands for mobile network access have resulted in a significant increase in bandwidth usage. By improving the system spectral efficiency, multi-way relay networks (MWRNs) provide promising approaches to address this challenge.
Ardakani, Masoud   +4 more
core   +1 more source

Calpain small subunit homodimerization is robust and calcium‐independent

open access: yesFEBS Letters, EarlyView.
Calpains dimerize via penta‐EF‐hand (PEF) domains. Using single‐molecule force spectroscopy, we measured the strength and kinetics of PEF–PEF homodimer binding. The interaction is robust, shows a transient conformational step before dissociation, and remains largely insensitive to Ca2+.
Nesha May O. Andoy   +4 more
wiley   +1 more source

Joint pre‐ and post‐equalization using optical multi‐level signaling

open access: yesThe Journal of Engineering, 2022
A joint pre‐ and post‐equalization scheme is proposed for an optical intensity modulation and direct detection (IM/DD) system. At the transmitter, a linear feed‐forward pre‐equalizer with just two, three, or four filter taps is suggested to limit the ...
Jasmeet Singh   +3 more
doaj   +1 more source

Coordinated Beamforming with Relaxed Zero Forcing: The Sequential Orthogonal Projection Combining Method and Rate Control

open access: yes, 2012
In this paper, coordinated beamforming based on relaxed zero forcing (RZF) for K transmitter-receiver pair multiple-input single-output (MISO) and multiple-input multiple-output (MIMO) interference channels is considered.
Lee, Gilwon   +3 more
core   +1 more source

Zero Forcing In SuperHyperGraphs

open access: yes, 2023
“Book #175” [ADDRESSED CITATION] [HG175b] Henry Garrett, “Zero Forcing In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zenodo.8020181). @googlebooks:https://books.google.com/books/about?id=- @GooglePlay:https://play.google.com/store/books/details?id=- @ResearchGate: https://www.researchgate.net/publication/- @WordPress: https ...
openaire   +1 more source

Properties of a q-Analogue of Zero Forcing [PDF]

open access: yesGraphs and Combinatorics, 2020
Zero forcing is a combinatorial game played on a graph where the goal is to start with all vertices unfilled and to change them to filled at minimal cost. In the original variation of the game there were two options. Namely, to fill any one single vertex at the cost of a single token; or if any currently filled vertex has a unique non-filled neighbor ...
Steve Butler   +8 more
openaire   +4 more sources

Home - About - Disclaimer - Privacy