Results 101 to 110 of about 549,593 (301)
The irregularity of graphs under graph operations
Discussiones Mathematicae Graph Theory, 2014 The irregularity of a simple undirected graph G was defined by Albertson [5] as irr(G) = ∑uv∈E(G) |dG(u) − dG(v)|, where dG(u) denotes the degree of a vertex u ∈ V (G).
Abdo Hosam, Dimitrov Darko
doaj +1 more source
FEBS Open Bio, EarlyView.A tri‐culture of iPSC‐derived neurons, astrocytes, and microglia treated with ferroptosis inducers as an Induced ferroptosis model was characterized by scRNA‐seq, cell survival, and cytokine release assays. This analysis revealed diverse microglial transcriptomic changes, indicating that the system captures key aspects of the complex cellular ...
Hongmei Lisa Li +6 more
wiley +1 more source
The dominant strong metric dimension of graphs
AKCE International Journal of Graphs and CombinatoricsGraphs are useful for analyzing the structure models in computer science, operations research, and sociology. Also, different types of graph products have several applications in modeling, including those found in network analysis, communication ...
M. Valiyanpour +2 more
doaj +1 more source
FEBS Open Bio, EarlyView.Time‐resolved X‐ray solution scattering captures how proteins change shape in real time under near‐native conditions. This article presents a practical workflow for light‐triggered TR‐XSS experiments, from data collection to structural refinement. Using a calcium‐transporting membrane protein as an example, the approach can be broadly applied to study ...
Fatemeh Sabzian‐Molaei +3 more
wiley +1 more source
Product version of reciprocal degree distance of composite graphs
Communications in Combinatorics and Optimization, 2018 In this paper, we present the upper bounds for the product version of reciprocal degree distance of the tensor product, join and strong product of two graphs in terms of other graph invariants including the Harary index and Zagreb indices.
K. Pattabiraman
doaj +1 more source
Single‐molecule DNA flow‐stretch assays for high‐throughput DNA–protein interaction studies
FEBS Open Bio, EarlyView.We describe an optimised single‐molecule DNA flow‐stretch assay that visualises DNA–protein interactions in real time. Linear DNA fragments are tethered to a surface and stretched by buffer flow for fluorescence imaging. Using λ and φX174 DNA, this protocol enhances reproducibility and accessibility, providing a versatile approach for studying diverse ...
Ayush Kumar Ganguli +8 more
wiley +1 more source
The geodetic number of strong product graphs
Discussiones Mathematicae Graph Theory, 2010 For two vertices u and v of a connected graph G, the set IG[u; v] consists of all those vertices lying on u v geodesics in G. Given a set S of vertices of G, the union of all sets IG[u; v] for u; v 2 S is denoted by IG[S]. A set S V (G) is a geodetic set if IG[S] = V (G) and the minimum cardinality of a geodetic set is its geodetic number g(G) of G ...
A.P. Santhakumaran, S.V. Ullas Chandran
openaire +1 more source
YIPFα1A expression is regulated by multilayered molecular mechanisms
FEBS Open Bio, EarlyView.YIPFα1A, a five‐pass Golgi protein, is regulated at multiple layers. (1) Rare‐codon enrichment drives translation‐coupled mRNA decay. (2) A proximal 3′‐UTR element stabilizes mRNA. (3) A distal 3′‐UTR element included by alternate poly(A) site usage represses translation, which can be overridden by the proximal 3′‐UTR element.
Tokio Takaji +2 more
wiley +1 more source
Sharp Upper Bounds for Generalized Edge-Connectivity of Product Graphs
Discussiones Mathematicae Graph Theory, 2016 The generalized k-connectivity κk(G) of a graph G was introduced by Hager in 1985. As a natural counterpart of this concept, Li et al. in 2011 introduced the concept of generalized k-edge-connectivity which is defined as λk(G) = min{λ(S) : S ⊆ V (G) and |
Sun Yuefang
doaj +1 more source
Boundary-type sets of strong product of directed graphs
, 2021 Bijo S. Anand +3 more
openalex +2 more sources