Results 41 to 50 of about 908,664 (294)
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
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
A Golden Ratio Inequality for Vertex Degrees of Graphs [PDF]
Motivated by the study of the crossing number of graphs, it is shown that, for trees, the sum of the products of the degrees of the end-vertices of all edges has an upper bound in terms of the sum of all vertex degrees to the power of $ϕ^2$, where $ϕ$ is the golden ratio. The exponent $ϕ^2$ is best possible.
Fiachra Knox, Bojan Mohar, David R. Wood
openaire +2 more sources
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
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
Component Order Edge Connectivity, Vertex Degrees, and Integer Partitions
Given a finite, simple graph G, the k-component order connectivity (resp. edge connectivity) of G is the minimum number of vertices (resp. edges) whose removal results in a subgraph in which every component has an order of at most k − 1.
Michael R. Yatauro
doaj +1 more source
Bridge and cycle degrees of vertices of graphs
The bridge degree bdeg v and cycle degree cdeg v of a vertex v in a graph G are, respectively, the number of bridges and number of cycle edges incident with v in G. A characterization of finite nonempty sets S of nonnegative integers is given for which S
Gary Chartrand +2 more
doaj +1 more source
On Omega Index and Average Degree of Graphs
Average degree of a graph is defined to be a graph invariant equal to the arithmetic mean of all vertex degrees and has many applications, especially in determining the irregularity degrees of networks and social sciences.
Sadik Delen +3 more
doaj +1 more source

