Results 51 to 60 of about 544,762 (274)
Retracts of strong products of graphs
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Imrich, W., Klavžar, S.
openaire +1 more source
Complex Vague Graphs and Their Application in Decision-Making Problems
Fuzzy graph models are found everywhere in natural and human made structures, including process dynamics in biological, physical and social systems. Since real-life problems are often uncertain due to inconsistent and indeterminate information, it is ...
Shouzhen Zeng +4 more
doaj +1 more source
Closed Formulae for the Strong Metric Dimension of Lexicographic Product Graphs
Given a connected graph G, a vertex w ∈ V (G) strongly resolves two vertices u, v ∈ V (G) if there exists some shortest u − w path containing v or some shortest v − w path containing u. A set S of vertices is a strong metric generator for G if every pair
Kuziak Dorota +2 more
doaj +1 more source
A Multiplicative Version of Forgotten Topological Index [PDF]
In this paper, we present upper bounds for the multiplicative forgotten topological index of several graph operations such as sum, Cartesian product, corona product, composition, strong product, disjunction and symmetric difference in terms of the F ...
Asghar Yousefi +3 more
doaj +1 more source
Domination Numbers of Semi-strong Products of Graphs [PDF]
This thesis examines the domination number of the semi-strong product of two graphs G and H where both G and H are simple and connected graphs. The product has an edge set that is the union of the edge set of the direct product of G and H together with ...
Cheney, Stephen R
core +1 more source
Crosstalk between the ribosome quality control‐associated E3 ubiquitin ligases LTN1 and RNF10
Loss of the E3 ligase LTN1, the ubiquitin‐like modifier UFM1, or the deubiquitinating enzyme UFSP2 disrupts endoplasmic reticulum–ribosome quality control (ER‐RQC), a pathway that removes stalled ribosomes and faulty proteins. This disruption may trigger a compensatory response to ER‐RQC defects, including increased expression of the E3 ligase RNF10 ...
Yuxi Huang +8 more
wiley +1 more source
On the Weak Reconstruction of Strong Product Graphs
We prove that any nontrivial connected strong product graph can be uniquely reconstructed from each of its one vertex deleted subgraphs.
Zmazek, Blaž, Žerovnik, Janez
openaire +2 more sources
The general position problem and strong resolving graphs
The general position number gp(G) of a connected graph G is the cardinality of a largest set S of vertices such that no three pairwise distinct vertices from S lie on a common geodesic.
Klavžar Sandi, Yero Ismael G.
doaj +1 more source
On The Basis Number Of Semi-Strong Product Of With Some Special Graphs [PDF]
The basis number, b(G) ,of a graph G is defined to be the smallest positive integer k such that G has a k-fold basis for its cycle space. We investigate the basis number of semi-strong product of with a path, a cycle, a star, a wheel and a complete ...
Ghassan Marougi
doaj +1 more source
Time after time – circadian clocks through the lens of oscillator theory
Oscillator theory bridges physics and circadian biology. Damped oscillators require external drivers, while limit cycles emerge from delayed feedback and nonlinearities. Coupling enables tissue‐level coherence, and entrainment aligns internal clocks with environmental cues.
Marta del Olmo +2 more
wiley +1 more source

