Results 41 to 50 of about 21,321 (296)
Limit distributions of maximum vertex degree in a conditional configuration graph
We consider configuration graphs with N vertices. The degrees of the vertices are independent identically distributed random variables following the power-law distribution with positive parameter τ.
Irina Cheplyukova
doaj +1 more source
F index of graphs based on four new operations related to the strong product
For a molecular graph, the first Zagreb index of a graph is equal to the sum of squares of the vertex degrees of the graph and the forgotten topological index (F-index) of a graph is defined as the sum of cubes of the vertex degrees of the graph.
D. Sarala +3 more
doaj +1 more source
The Zagreb-coindex of Four Operations on Graphs
In 1972, within a study of the structure-dependency of total π-electron energy (E), it was shown that E depends on the sum of squares of the vertex degrees of the molecular graph (later named first Zagreb index), and thus provides a measure of the ...
Mobina Ghorbaninejad
doaj +1 more source
Total vertex product irregularity strength of graphs [PDF]
Consider a simple graph $G$. We call a labeling $w:E(G)\cup V(G)\rightarrow \{1, 2, \ldots, s\}$ (total vertex) product-irregular, if all product degrees $pd_G(v)$ induced by this labeling are distinct, where \( pd_G(v)=w(v)×\prod_{e\in v}w(e) \).
Marcin Anholcer +5 more
core +1 more source
In this article, a quantitative structure-property relationship is performed for the prediction of six physico-chemical properties of 16 alkaloid structures using three different types of degree-based topological indices.
Muhammad Waheed Rasheed +2 more
doaj +1 more source
We consider configuration graphs with N vertices. The degrees of the vertices are independent random variables identically distributed according to the power law, with a positive parameter τ .
Yury Pavlov
doaj +1 more source
Component order edge connectivity, vertex degrees, and integer partitions [PDF]
Given a finite, simple graph $G$, the $k$-component order edge connectivity of $G$ is the minimum number of edges whose removal results in a subgraph for which every component has order at most $k-1$.
Yatauro, Michael
core +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
Some results on the palette index of graphs [PDF]
Given a proper edge coloring $\varphi$ of a graph $G$, we define the palette $S_{G}(v,\varphi)$ of a vertex $v \in V(G)$ as the set of all colors appearing on edges incident with $v$.
C. J. Casselgren, Petros A. Petrosyan
doaj +1 more source
A topological index is a real number calculated from the structure of a chemical compound to describe its topology. The use of molecular descriptors has been increasing in recent years, helping to determine the physicochemical and biological properties ...
Muhammad Waheed Rasheed +2 more
doaj +1 more source

