Results 121 to 130 of about 8,016,307 (335)
Metric Dimension of Circulant Graphs with 5 Consecutive Generators
MathematicsThe problem of finding the metric dimension of circulant graphs with t generators 1,2,…,t (and their inverses) has been extensively studied. The problem is solved for t=2,3,4, and some exact values and bounds are known also for t=5. We solve all the open
Martin Knor +2 more
doaj +1 more source
Computing Metric Dimension of Certain Families of Toeplitz Graphs
IEEE Access, 2019 The position of a moving point in a connected graph can be identified by computing the distance from the point to a set of sonar stations which have been appropriately situated in the graph. Let Q = {q1, q2, ...
Jia-Bao Liu +3 more
doaj +1 more source
The Metric Dimension of Graph with Pendant Edges [PDF]
, 2008 For an ordered set W = {w_1,w_2,...,w_k} of vertices and a vertex v in a connected graph G, the representation of v with respect to W is the ordered k-tuple r(v|W) = (d(v,w_1), d(v,w_2),..., d(v,w_k)) where d(x,y) represents the distance between the ...
Baskoro, Edy Tri +3 more
core
FEBS Letters, EarlyView.This perspective highlights emerging insights into how the circadian transcription factor CLOCK:BMAL1 regulates chromatin architecture, cooperates with other transcription factors, and coordinates enhancer dynamics. We propose an updated framework for how circadian transcription factors operate within dynamic and multifactorial chromatin landscapes ...
Xinyu Y. Nie, Jerome S. Menet
wiley +1 more source
Real‐time assay of ribonucleotide reductase activity with a fluorescent RNA aptamer
FEBS Letters, EarlyView.Ribonucleotide reductases (RNR) synthesize DNA building blocks de novo, making them crucial in DNA replication and drug targeting. FLARE introduces the first single‐tube real‐time coupled RNR assay, which enables isothermal tracking of RNR activity at nanomolar enzyme levels and allows the reconstruction of allosteric regulatory patterns and rapid ...
Jacopo De Capitani +4 more
wiley +1 more source
Total resolving number of edge cycle graphs
AKCE International Journal of Graphs and Combinatorics, 2020 Let be a simple connected graph. An ordered subset W of V is said to be a resolving set of G if every vertex is uniquely determined by its vector of distances to the vertices in W. The minimum cardinality of a resolving set is called the resolving number
J. Paulraj Joseph, N. Shunmugapriya
doaj +1 more source
Investigating computational models of perceptual attack time [PDF]
, 2006 The perceptual attack time (PAT) is the compensation for differing attack components of sounds, in the case of seeking a perceptually isochronous presentation of sounds. It has applications in scheduling and is related to, but not necessarily the same as,
Collins, Nick
core +2 more sources
The minimum number of some resolving sets for the Crystal Cubic Carbon CCC(n) and the Layer Cycle Graph LCG(n, k) [PDF]
, 2022 Jia Liu, Ali Zafari
openalex +1 more source
Disordered but rhythmic—the role of intrinsic protein disorder in eukaryotic circadian timing
FEBS Letters, EarlyView.Unstructured domains known as intrinsically disordered regions (IDRs) are present in nearly every part of the eukaryotic core circadian oscillator. IDRs enable many diverse inter‐ and intramolecular interactions that support clock function. IDR conformations are highly tunable by post‐translational modifications and environmental conditions, which ...
Emery T. Usher, Jacqueline F. Pelham
wiley +1 more source
On the Families of Graphs With Unbounded Metric Dimension
IEEE Access, 2019 A family G of connected graphs is a family with unbounded metric dimension if dim(G) is not constant and depends on the order of graph. In this paper, we compute the metric dimension of the splitting graphs S(Pn) and S(Cn) of a path and cycle.
Heng Pan +4 more
doaj +1 more source