Results 101 to 110 of about 8,830,736 (317)
Metric Dimension of Circulant Graphs with 5 Consecutive Generators
The 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
Organoids in pediatric cancer research
Organoid technology has revolutionized cancer research, yet its application in pediatric oncology remains limited. Recent advances have enabled the development of pediatric tumor organoids, offering new insights into disease biology, treatment response, and interactions with the tumor microenvironment.
Carla Ríos Arceo, Jarno Drost
wiley +1 more source
On the Metric Dimension of Corona Product of Graphs [PDF]
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 +2 more
core
Computing Metric Dimension of Certain Families of Toeplitz Graphs
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
Reciprocal control of viral infection and phosphoinositide dynamics
Phosphoinositides, although scarce, regulate key cellular processes, including membrane dynamics and signaling. Viruses exploit these lipids to support their entry, replication, assembly, and egress. The central role of phosphoinositides in infection highlights phosphoinositide metabolism as a promising antiviral target.
Marie Déborah Bancilhon, Bruno Mesmin
wiley +1 more source
On resolving domination number of special family of graphs
Let G be a simple, finite, and connected graph. A dominating set D is a set of vertices such that each vertex of G is either in D or has at least one neighbor in D.
Y. Wangguway +4 more
semanticscholar +1 more source
Fluorescent probes allow dynamic visualization of phosphoinositides in living cells (left), whereas mass spectrometry provides high‐sensitivity, isomer‐resolved quantitation (right). Their synergistic use captures complementary aspects of lipid signaling. This review illustrates how these approaches reveal the spatiotemporal regulation and quantitative
Hiroaki Kajiho +3 more
wiley +1 more source
Numerical interactive controller [PDF]
Device allows interaction of operator with data in computer central processor in order to shift frame of data in Cartesian coordinates and slew desired data into view.
Brokl, S. S., Zygielbaum, A. I.
core +1 more source
Total resolving number of edge cycle graphs
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

