Results 101 to 110 of about 146,548 (294)
Resolving Domination Number of Graphs
, 2019 For a set W = { s1,s2,...,sk of vertices of a graph G, the representation multiset of a vertexv of G with respect to W is r(v | W ) = { d(v, s1),d(v, s2),...,d(v, sk) } , where d(v, si) is a distance between of the vertex v and the vertices in
KRISTIANA, Arika Indah +2 more
core
On Fault-Tolerant Resolving Sets of Some Families of Ladder Networks
, 2021 In computer networks, vertices represent hosts or servers, and edges represent as the connecting medium between them. In localization, some special vertices (resolving sets) are selected to locate the position of all vertices in a computer network. If an
Hua Wang +4 more
core +1 more source
The ubiquitin‐proteasome system and autophagy as guardians of the cellular proteome
FEBS Letters, EarlyView.This Perspective covers the three principles governing the crosstalk between the ubiquitin‐proteasome system and autophagy in cellular proteostasis: (1) a shared ubiquitin code routing substrates via shuttle factors or autophagy receptors; (2) spatial compartmentalization into phase‐separated degradation hubs and organelle‐specific modules (exemplified
Ivan Dikic
wiley +1 more source
Graphs with distinguishing sets of size k
Kuwait Journal of ScienceThe size of a resolving set R of a non-trivial connected graph Γ of order n ≥ 2 is the number of edges in the induced subgraph .The minimum cardinality of a resolving set of size k of graph Γ is called the metric dimension of size k, denoted by β(k)(Γ ...
Muhammad Naeem Azhar +3 more
doaj +1 more source
More large sets of resolvable MTS and resolvable DTS with odd orders
Discrete Mathematics, 2008 Consider a Mendelsohn (resp. directed) triple system on a set \(X\) of order \(v\). Such a triple system is called resolvable if its blocks can be partitioned into subsets (called parallel classes), each containing every element of \(X\) exactly once. A large set \(L\) of Mendelsohn (resp.
Qingde Kang, Hongtao Zhao
openaire +1 more source
FEBS Letters, EarlyView.An unexpected alternative interaction site for ethyl viologen was identified in formate dehydrogenase 1 from Methylorubrum extorquens. Combined mutagenesis, kinetic analysis, and docking revealed that aromatic residues near an iron–sulfur cluster enable flavin mononucleotide‐independent electron transfer, offering a framework for engineering improved ...
Eleni G. Poloniataki, Yong Hwan Kim
wiley +1 more source
From mice to humans—divergent strategies for intestinal homeostasis and regeneration
FEBS Letters, EarlyView.Recent advances such as organoid genome editing, xenotransplantation, imaging, and whole‐genome sequencing have enabled direct studies of human intestinal stem cells (ISCs). These studies reveal species‐specific features, including slower ISC proliferation, distinct injury responses, slower somatic mutation accumulation in humans, and an inverse ...
Keiko Ishikawa +2 more
wiley +1 more source
Metric dimension of star fan graph
Scientific ReportsEvery node in a network is said to be resolved if it can be uniquely identified by a vector of distances to a specific set of nodes. The metric dimension is equivalent to the least possible cardinal number of a resolving set.
S. Prabhu +2 more
doaj +1 more source
Browder S-Resolvent Equation in Quaternionic Setting
Complex Analysis and Operator TheoryThis paper is devoted to the study of the S-eigenvalue of finite type of a bounded right quaternionic linear operator acting in a right quaternionic Hilbert space. The study is based on the different properties of the Riesz projection associated with the connected part of the S-spectrum.
Baloudi, Hatem +2 more
openaire +2 more sources
The Resolving Graph of Amalgamation of Cycles
, 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 between the ...
Salman, A.N.M +3 more
core