Results 91 to 100 of about 114,426,441 (303)

On distance integral graphs

open access: yesDiscrete Mathematics, 2015
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Milan Pokorný   +3 more
openaire   +4 more sources

Refinement of amino‐acid conformation vs. difference density maps in time‐resolved serial femtosecond crystallography data analysis

open access: yesFEBS Open Bio, EarlyView.
The dFoCC pipeline starts with observed DED and resting‐state coordinates, which are then used to generate a library of triggered states. Correlation analysis of the calculated DED features of each candidate vs observed DED permits quantitative evaluation of candidate structural quality.
Meng Iao Fong   +3 more
wiley   +1 more source

Spectral Characterization of the Hamming Graphs [PDF]

open access: yes
We show that the Hamming graph H(3; q) with diameter three is uniquely determined by its spectrum for q ¸ 36. Moreover, we show that for given integer D ¸ 2, any graph cospectral with the Hamming graph H(D; q) is locally the disjoint union of D copies of
Koolen, J.H., Bang, S., Dam, E.R. van
core  

Hamilton cycles in almost distance-hereditary graphs

open access: yesOpen Mathematics, 2016
Let G be a graph on n ≥ 3 vertices. A graph G is almost distance-hereditary if each connected induced subgraph H of G has the property dH(x, y) ≤ dG(x, y) + 1 for any pair of vertices x, y ∈ V(H).
Chen Bing, Ning Bo
doaj   +1 more source

On the distance α-spectral radius of a connected graph

open access: yesJournal of Inequalities and Applications, 2020
For a connected graph G and α ∈ [ 0 , 1 ) $\alpha \in [0,1)$ , the distance α-spectral radius of G is the spectral radius of the matrix D α ( G ) $D_{\alpha }(G)$ defined as D α ( G ) = α T ( G ) + ( 1 − α ) D ( G ) $D_{\alpha }(G)=\alpha T(G)+(1-\alpha )
Haiyan Guo, Bo Zhou
doaj   +1 more source

Connectivity of distance graphs

open access: yesDiscrete Mathematics, 1992
Let \(K\supseteq\mathbb{Q}\) be a \(\mathbb{Z}\)-module and \(G\) a graph with a \(K\)- space as vertex set \(V\). If the edges of \(G\) are preserved under translations in \(V\) and \(G\) has more than one connected component, then the author shows that \(G\) has infinitely many components.
openaire   +2 more sources

From energy provision to protein synthesis: Tunnelling nanotubes as mediators of intercellular metabolic cooperation in cancer

open access: yesFEBS Open Bio, EarlyView.
The cytoskeleton‐mediated transport of mitochondria via tunnelling nanotubes restores respiration, increases ATP production, rescues cells from apoptosis, activates the AKT/mTOR signalling pathway, promotes cell migration and invasiveness, contributes to cancer progression and treatment resistance.
Stanislava Martínková, Jan Trnka
wiley   +1 more source

On reciprocal degree distance of graphs. [PDF]

open access: yesHeliyon, 2023
An M, Zhang Y, Das KC, Shang Y.
europepmc   +1 more source

MagmaFlow: A desktop platform for artificial intelligence‐driven expression analysis

open access: yesFEBS Open Bio, EarlyView.
MagmaFlow is a free, no‐code platform for gene expression analysis. It generates interactive volcano plots, links genes to literature, pathways, and diseases, prioritizes candidates using millions of publications, identifies affected biological processes, builds network diagrams, and exports publication‐ready figures and reports for macOS and Windows ...
Carlos E. Buss   +7 more
wiley   +1 more source

Home - About - Disclaimer - Privacy