Results 51 to 60 of about 4,115 (305)
Some Bond Incident Degree Indices of (Molecular) Graphs with Fixed Order and Number of Cut Vertices
Discrete Dynamics in Nature and Society, 2021 A bond incident degree (BID) index of a graph G is defined as ∑uv∈EGfdGu,dGv, where dGw denotes the degree of a vertex w of G, EG is the edge set of G, and f is a real-valued symmetric function. The choice fdGu,dGv=adGu+adGv in the aforementioned formula
Abeer M. Albalahi +3 more
doaj +1 more source
Zeroth-order general Randić index of cactus graphs
AKCE International Journal of Graphs and Combinatorics, 2019 A connected graph G is said to be cactus if no two cycles of G have any common edge. The present note is devoted to developing some extremal results for the zeroth-order general Randić index of cactus graphs and finding some sharp bounds on this index ...
Hassan Ahmed +2 more
doaj +2 more sources
Extremal properties of distance-based graph invariants for $k$-trees [PDF]
, 2017 summary:Sharp bounds on some distance-based graph invariants of $n$-vertex $k$-trees are established in a unified approach, which may be viewed as the weighted Wiener index or weighted Harary index.
Zhang, Minjie +3 more
core +1 more source
Molecular Oncology, EarlyView.Tumors contain diverse cellular states whose behavior is shaped by context‐dependent gene coordination. By comparing gene–gene relationships across biological contexts, we identify adaptive transcriptional modules that reorganize into distinct vulnerability axes.
Brian Nelson +9 more
wiley +1 more source
Exact solutions to the Erdős-Rothschild problem
Forum of Mathematics, SigmaLet $\boldsymbol {k} := (k_1,\ldots ,k_s)$ be a sequence of natural numbers. For a graph G, let $F(G;\boldsymbol {k})$ denote the number of colourings of the edges of G with colours $1,\dots ,s$ such that, for every $c \in \{1 ...
Oleg Pikhurko, Katherine Staden
doaj +1 more source
Unicyclic Graphs with the Fourth Extremal Wiener Indices
Journal of Chemistry, 2020 A graph is called unicyclic if the graph contains exactly one cycle. Unicyclic graphs with the fourth extremal Wiener indices are characterized. It is shown that, among all unicyclic graphs with n≥8 vertices, C5Sn−4 and C2u1,u2S3,Sn−4 attain the fourth ...
Guangfu Wang +3 more
doaj +1 more source
Weakening the nuclear envelope: Lamin B receptor in melanoma metastasis
Molecular Oncology, EarlyView.LBR‐driven nuclear fragility supports melanoma invasion. A: Melanocyte presents low LBR (Lamin B Receptor) levels, maintaining nuclear integrity and lamina‐chromatin tethering. B: During malignant progression, upregulation of LBR clusters at the INM (Inner Nuclear Membrane) during confined migration causes local lamina weakening and cholesterol ...
Francesca Lorenzini +1 more
wiley +1 more source
AKCE International Journal of Graphs and Combinatorics, 2017 The extremal number or simply denotes the maximal number of edges in a graph on vertices with forbidden subgraphs and . The exact number of is only known for up to and . There are upper and lower bounds of for other values of .
Novi H. Bong
doaj +1 more source
Dense H-free graphs are almost (Χ(H)-1)-partite [PDF]
, 2010 By using the Szemeredi Regularity Lemma, Alon and Sudakov recently extended the classical Andrasfai-Erdos-Sos theorem to cover general graphs. We prove, without using the Regularity Lemma, that the following stronger statement is true.
Peter Allen, Allen, Peter
core
FEBS Open Bio, EarlyView.This protocol paper outlines methods to establish the success of a time‐resolved serial crystallographic experiment, by means of statistical analysis of timepoint data in reciprocal space and models in real space. We show how to amplify the signal from excited states to visualise structural changes in successful experiments.
Jake Hill +4 more
wiley +1 more source