Results 61 to 70 of about 4,605,701 (218)
Eccentric connectivity index of chemical trees [PDF]
Let G = (V, E) be a simple connected molecular graph. In such a simple molecular graph, vertices and edges are depicted atoms and chemical bonds respectively, we refer to the sets of vertices by V (G) and edges by E (G). If d(u, v) be distance between two vertices u, v ∈ V(G) and can be defined as the length of a shortest path joining them.
R. S. Haoer +4 more
openaire +1 more source
Degree-Distance Based Topological Indices of Crystal Cubic Carbon Structure
Chemical graph theory comprehends the basic properties of an atomic graph. The sub-atomic diagrams are the graphs that are comprised of particles called vertices and the covalent bond between them are called edges.
Hong Yang +3 more
doaj +1 more source
UiO‐66(Zr) metal–organic frameworks are chemically stable, biocompatible, and highly tunable nanomaterials. Their modular structure enables controlled drug delivery, multimodal bioimaging, and light‐activated photodynamic therapy, supporting integrated diagnostic and therapeutic (theranostic) applications in cancer and biomedical research.
Veronika Huntošová +2 more
wiley +1 more source
Eccentric harmonic index of a graph
In this paper, we introduce the eccentric harmonic index of a graph G, so that it is the sum of the terms for the edges where ei is the eccentricity of the ith vertex of the graph G. We compute the exact values of He for some standard graphs.
M. I. Sowaity +3 more
doaj +1 more source
MagmaFlow: A desktop platform for artificial intelligence‐driven expression analysis
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
On a Lower Bound for the Eccentric Connectivity Index of Graphs [PDF]
The eccentric connectivity index of a graph $G$, denoted by $ξ^{c}(G)$, defined as $ξ^{c}(G)$ = $\sum_{v \in V(G)}ε(v) \cdot d(v)$, where $ε(v)$ and $d(v)$ denotes the eccentricity and degree of a vertex $v$ in a graph $G$, respectively. The volcano graph $V_{n,d}$ is a graph obtained from a path $P_{d+1}$ and a set $S$ of $n-d-1$ vertices, by joining ...
openaire +2 more sources
Eccentric connectivity index of graphs with subdivided edges
We consider four classes of graphs arising from a given graph via different types of edge subdivisions. We present explicit formulas expressing their eccentric connectivity index in terms of the eccentric connectivity index of the original graph and some auxiliary invariants.
Zahra Yarahmadi +2 more
openaire +2 more sources
Accurate and noninvasive prostate cancer detection using plasma‐derived extracellular vesicle RNA
Plasma extracellular vesicles were captured with WGA‐conjugated magnetic beads and profiled for RNA biomarkers. A three‐RNA panel (NM_024955, NR_047469, and NR_002564) distinguished prostate cancer from healthy controls and benign prostatic hyperplasia, supporting a simple, noninvasive approach to improve prostate cancer detection.
Hanping Wei, Haoran Wu, Wei Feng
wiley +1 more source
Connective eccentric index of some graph operations
9 pages, 3 ...
Nilanjan De +2 more
openaire +3 more sources

