Results 91 to 100 of about 8,830,736 (317)

Dimensi Metrik Graf Kr+mKsr, m, r, s, En

open access: yesCauchy: Jurnal Matematika Murni dan Aplikasi, 2011
The concept of minimum resolving set has proved to be useful and or related to a variety of fields such as Chemistry, Robotic Navigation, and Combinatorial Search and Optimization. So that, this thesis explains the metric dimension of graph Kr + mKsr, m,
Hindayani Hindayani
doaj   +1 more source

Resolving the incompatibility between SET-LRP and non-disproportionating solvents

open access: yesGiant, 2023
Cu(0)-catalyzed single-electron transfer-living radical polymerization (SET-LRP) has shown great potential for applications in which well-defined chain end-functionalized polymers are demanded as final products or as intermediates.
Nabil Bensabeh   +6 more
doaj   +1 more source

ALGORITHM FOR FINDING DOMINATION RESOLVING NUMBER OF A GRAPH

open access: yesJOURNAL OF MECHANICS OF CONTINUA AND MATHEMATICAL SCIENCES
A minimum resolving set is a resolving set with the lowest cardinality and its cardinality is a dimension of connected graph , represented by . A dominating set is a set of vertices such that each of is either in or has at least one neighbor in .
Iqbal M. Batiha   +2 more
semanticscholar   +1 more source

Prevalence and Trajectory of Household Material Hardship Among Children With Advanced Cancer

open access: yesPediatric Blood &Cancer, EarlyView.
ABSTRACT Background/Objectives Families of children with advanced cancer living in poverty experience inferior outcomes including poor parent mental health and worse child quality of life. Household material hardship (HMH: food, housing, transportation, and/or utility insecurity) is a modifiable poverty exposure—and potential intervention target—that ...
Sarah Wright   +13 more
wiley   +1 more source

On regular fuzzy resolving set

open access: yes, 2022
In a fuzzy graph G, if the degree of each vertex is the same, then it is called a regular fuzzy graph. The representation of ? ? H with respect to the subset H of ? are all distinct then H is called the resolving set of the fuzzy graph G(V, ?, µ).
Shanmugapriya, R., Jiny D., Mary
openaire   +1 more source

Revealing the structure of land plant photosystem II: the journey from negative‐stain EM to cryo‐EM

open access: yesFEBS Letters, EarlyView.
Advances in cryo‐EM have revealed the detailed structure of Photosystem II, a key protein complex driving photosynthesis. This review traces the journey from early low‐resolution images to high‐resolution models, highlighting how these discoveries deepen our understanding of light harvesting and energy conversion in plants.
Roman Kouřil
wiley   +1 more source

The Metric Dimension of Amalgamation of Cycles [PDF]

open access: yes, 2010
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 ...
Baskoro, Edy Tri   +3 more
core  

Resolving noise–control conflict by gene duplication

open access: yesbioRxiv, 2019
Gene duplication promotes adaptive evolution in two principle ways: allowing one duplicate to evolve a new function and resolving adaptive conflicts by splitting ancestral functions between the duplicates.
Michal Chapal   +4 more
semanticscholar   +1 more source

Mapping the evolution of mitochondrial complex I through structural variation

open access: yesFEBS Letters, EarlyView.
Respiratory complex I (CI) is crucial for bioenergetic metabolism in many prokaryotes and eukaryotes. It is composed of a conserved set of core subunits and additional accessory subunits that vary depending on the organism. Here, we categorize CI subunits from available structures to map the evolution of CI across eukaryotes. Respiratory complex I (CI)
Dong‐Woo Shin   +2 more
wiley   +1 more source

The metric dimension and metric independence of a graph [PDF]

open access: yes, 2001
A vertex x of a graph G resolves two vertices u and v of G if the distance from x to u does not equal the distance from x to v. A set S of vertices of G is a resolving set for G if every two distinct vertices of G are resolved by some vertex of S. The
Currie, James, Oellerman, Ortrud R.
core  

Home - About - Disclaimer - Privacy