Results 81 to 90 of about 8,016,307 (335)
DIMENSI METRIK GRAPH LOBSTER Ln (q;r)
E-Jurnal Matematika, 2013 The metric dimension of connected graph G is the cardinality of minimum resolving set in graph G. In this research, we study how to find the metric dimension of lobster graph Ln (q;r).
PANDE GDE DONY GUMILAR +2 more
doaj +1 more source
Metric dimension of ideal-intersection graph of the ring
AKCE International Journal of Graphs and Combinatorics, 2021 Metric Dimension of a simple connected graph is the minimum number of vertices those are used to identify each vertex of the graph uniquely using distance code. In this paper, we determine metric dimension of ideal-intersection graph for the ring where n
Laxman Saha +2 more
doaj +1 more source
FEBS Letters, EarlyView.Angiotensin II (AngII), a neuropeptide, interacts with amyloid‐β (Aβ), a key player in Alzheimer's disease. This study reveals that AngII reduces Aβ aggregation and membrane disruption in vitro. Biophysical assays and molecular modeling suggest AngII binds disordered Aβ forms, potentially modulating early amyloidogenic events and contributing to ...
Mohsen Habibnia +5 more
wiley +1 more source
Conditional resolvability in graphs: a survey
International Journal of Mathematics and Mathematical Sciences, 2004 For an ordered set W={w1,w2,…,wk} of vertices and a vertex v in a connected graph G, the code of v with respect to W is the k-vector cW(v)=(d(v,w1),d(v,w2),…,d(v,wk)), where d(x,y) represents the distance between the vertices x and y.
Varaporn Saenpholphat, Ping Zhang
doaj +1 more source
Primatika, 2019 Graf merupakan suatu (V, E) dengan V adalah himpunan simpul dan E adalah himpunan edge, yaitu pasangan simpul dari V. Jika G adalah graf terhubung, jarak antara dua simpul u dan v di G dinotasikan dengan adalah panjang lintasan terpendek di antara ...
Petrus Fendiyanto
doaj +1 more source
FEBS Letters, EarlyView.Cells must clear mislocalized or faulty proteins from membranes to survive. The AAA+ ATPase Msp1 performs this task, but dissecting how its six subunits work together is challenging. We engineered linked dimers with varied numbers of functional subunits to reveal how Msp1 subunits cooperate and use energy to extract proteins from the lipid bilayer ...
Deepika Gaur +5 more
wiley +1 more source
The uncrossing partial order on matchings is Eulerian [PDF]
, 2014 We prove that the partial order on the set of matchings of 2n points on a circle, given by resolving crossings, is an Eulerian poset.Comment: 6 ...
Lam, Thomas
core
Organoids in pediatric cancer research
FEBS Letters, EarlyView.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
Computation of Resolvability Parameters for Benzenoid Hammer Graph
Journal of Mathematics, 2022 A representation of each vertex of a network into distance-based arbitrary tuple form, adding the condition of uniqueness of each vertex with reference to some settled vertices. Such settled vertices form a set known as resolving set.
Ali Ahmad, Al-Nashri Al-Hossain Ahmad
doaj +1 more source
On the metric dimension of imprimitive distance-regular graphs
, 2016 A resolving set for a graph $\Gamma$ is a collection of vertices $S$, chosen so that for each vertex $v$, the list of distances from $v$ to the members of $S$ uniquely specifies $v$.
Bailey, Robert F.
core +1 more source