Results 101 to 110 of about 1,442 (223)

Bond and Antibond Resonances: A Unified Framework for Singlet Biradical Character

open access: yesChemistry – A European Journal, Volume 32, Issue 23, 16 June 2026.
The electronic structure of a variety of singlet biradicaloids may be described in the Lewis picture using single antibonds as the central bonding motif. In conjunction with a consistent set of biradical indicators, we can resolve some long‐standing disputes over the biradical character of molecules such as O3 and S2N2.
Daniel T. Gschwind, Jonas Bresien
wiley   +1 more source

LOCAL IRREGULARITY VERTEX COLORING OF BICYCLIC GRAPH FAMILIES

open access: yesBarekeng
The graph in this research is a simple and connected graph with  as vertex set and  as an edge set. We used deductive axiomatic and pattern recognition method.
Arika Indah Kristiana   +5 more
doaj   +1 more source

Molecular cancer prevention: Intercepting disease

open access: yesMolecular Oncology, Volume 20, Issue 6, Page 1392-1397, June 2026.
Oncological practice must evolve, from treating established tumours to proactive cancer interception before clinical manifestation. This will require mechanistic insight into tumour initiation, validated biomarkers of early disease development and redesigned clinical trials, enabling cancer interception to become a core pillar of oncology with the ...
Charlotte Grieco   +2 more
wiley   +1 more source

Extremal unicyclic and bicyclic graphs with respect to the -index

open access: yesAKCE International Journal of Graphs and Combinatorics, 2017
In the study of structure-dependency of the total -electron energy in 1972, it was shown that this energy depends on the degree based sum and , where is the degree of a vertex of under consideration molecular graph .
Shehnaz Akhter   +2 more
doaj   +1 more source

On Extended Adjacency Index with Respect to Acyclic, Unicyclic and Bicyclic Graphs

open access: yesMathematics, 2019
For a (molecular) graph G, the extended adjacency index E A ( G ) is defined as Equation (1). In this paper we introduce some graph transformations which increase or decrease the extended adjacency ( E A ) index.
Bin Yang   +4 more
doaj   +1 more source

High‐Intensity Interval Training Boosts Immune Cells in Advanced Cancer Patients and Healthy Controls: Implications for Cancer Care

open access: yesCancer Medicine, Volume 15, Issue 6, June 2026.
ABSTRACT Background Regular exercise improves quality of life (QoL) and reduces fatigue in advanced cancer patients (ACP), but acute immune responses are underexplored. This study investigated the effects of a single high‐intensity interval training (HIIT) session on natural killer (NK) cells and circulating innate lymphoid cells (cILCs) in ACP ...
Fabian Kiehl   +8 more
wiley   +1 more source

On the multiplicative sum Zagreb index of molecular graphs

open access: yesOpen Mathematics
Multiplicative sum Zagreb index is a modified version of the famous Zagreb indices. For a graph GG, the multiplicative sum Zagreb index is defined as Π1*(G)=∏uv∈E(G)(dG(u)+dG(v)){\Pi }_{1}^{* }\left(G)={\prod }_{uv\in E\left(G)}\left({d}_{G}\left(u)+{d}_{
Sun Xiaoling, Du Jianwei, Mei Yinzhen
doaj   +1 more source

Identification of Novel Small‐Molecule Inhibitors Targeting KDM5B and Evaluation of Their Antitumour Effects

open access: yesCancer Medicine, Volume 15, Issue 6, June 2026.
ABSTRACT KDM5B, a member of the KDM5 family of histone demethylases, plays a critical role in transcriptional repression by demethylating H3K4me2/3. It regulates key biological processes such as development, stem cell maintenance, and oncogenesis, and its aberrant expression is implicated in various cancers. Accordingly, KDM5B is considered a promising
Tomoaki Hara   +16 more
wiley   +1 more source

On The Determinant of q-Distance Matrix of a Graph

open access: yesDiscussiones Mathematicae Graph Theory, 2014
In this note, we show how the determinant of the q-distance matrix Dq(T) of a weighted directed graph G can be expressed in terms of the corresponding determinants for the blocks of G, and thus generalize the results obtained by Graham et al.
Li Hong-Hai, Su Li, Zhang Jing
doaj   +1 more source

Computing the Determinant of the Distance Matrix of a Bicyclic Graph

open access: yesElectronic Notes in Theoretical Computer Science, 2019
Abstract Let G be a connected graph with vertex set V = {v1, ..., vn}. The distance d(vi, vj) between two vertices vi and vj is the number of edges of a shortest path linking them. The distance matrix of G is the n × n matrix such that its (i, j)-entry is equal to d(vi, vj).
Ezequiel Dratman   +4 more
openaire   +2 more sources

Home - About - Disclaimer - Privacy