Results 41 to 50 of about 39,392 (275)

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, Akbar Ali, Tayyba Zafar, Wael W. Mohammed   +3 more
doaj   +1 more source

Extremal Edge-Girth-Regular Graphs

Graphs and Combinatorics, 2021
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ajda Zavrtanik Drglin, Slobodan Filipovski, Robert Jajcay, Tom Raiman   +3 more
openaire   +3 more sources

LDAcoop: Integrating non‐linear population dynamics into the analysis of clonogenic growth in vitro

Molecular Oncology, EarlyView.
Limiting dilution assays (LDAs) quantify clonogenic growth by seeding serial dilutions of cells and scoring wells for colony formation. The fraction of negative wells is plotted against cells seeded and analyzed using the non‐linear modeling of LDAcoop.
Nikko Brix, Daniel Samaga, Katharina Gehr, Benedek Dankó, Mohamed Schumann, Guido Drexler, Ahmed Alnatsha, Georg Beyer, Ujjwal Mahajan, Martin Selmansberger, Julia Mayerle, Claus Belka, Horst Zitzelsberger, Kirsten Lauber   +13 more
wiley   +1 more source

Exact solutions to the Erdős-Rothschild problem

Forum of Mathematics, Sigma
Let $\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

Genetic attenuation of ALDH1A1 increases metastatic potential and aggressiveness in colorectal cancer

Molecular Oncology, EarlyView.
Aldehyde dehydrogenase 1A1 (ALDH1A1) is a cancer stem cell marker in several malignancies. We established a novel epithelial cell line from rectal adenocarcinoma with unique overexpression of this enzyme. Genetic attenuation of ALDH1A1 led to increased invasive capacity and metastatic potential, the inhibition of proliferation activity, and ultimately ...
Martina Poturnajova, Zuzana Kozovska, Ondrej Pos, Kristina Pavlov, Sachin Gulati, Peter Makovicky, Kristina Jakic, Monika Burikova, Eva Sedlackova, Barbora Svitkova, Silvia Tyciakova, Vojtech Bystry, Nicolas Blavet, Boris Tichy, Matej Hrnciar, Jaroslav Budis, Miroslav Tomas, Peter Dubovan, Georgina Kolnikova, Veronika Repaska, Nikoleta Mojzesova, Eva Zomborska, Daniel Pindak, Michal Mego, Tomas Szemes, Miroslava Matuskova   +25 more
wiley   +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, Yujun Yang, Yuliang Cao, Shoujun Xu   +3 more
doaj   +1 more source

Network divergence analysis identifies adaptive gene modules and two orthogonal vulnerability axes in pancreatic cancer

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, Lyanne Delgado‐Coka, Natalia Marchenko, Luisa F. Escobar‐Hoyos, Kenneth R. Shroyer, Alisa Yurovsky, Trey Ideker, Gábor Balázsi, Thomas MacCarthy, Scott Powers   +9 more
wiley   +1 more source

Some new upper bounds of

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

On Hamiltonian Cycles in Claw-Free Cubic Graphs

Discussiones Mathematicae Graph Theory, 2022
We show that every claw-free cubic graph of order n at least 8 has at most 2⌊n4⌋{2^{\left\lfloor {{n \over 4}} \right\rfloor }} Hamiltonian cycles, and we also characterize all extremal graphs.
Mohr Elena, Rautenbach Dieter
doaj   +1 more source

Analysing the significance of small conformational changes and low occupancy states in serial crystallographic data

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, Yelyzaveta Pulnova, Elke De Zitter, Helen M. Ginn, Briony A. Yorke   +4 more
wiley   +1 more source