Results 51 to 60 of about 196,583,728 (297)
On Domination Topological Indices of Graphs
International Journal of Analysis and Applications, 2020 Topological indices and domination in graphs are the essential topics in the theory of graphs. A set of vertices D ⊆ V (G) is said to be a dominating set for G if any vertex v ∈ V − D is adjacent to some vertex u ∈ D.
A.M. Hanan Ahmed +2 more
doaj
ORDERING CATACONDENSED HEXAGONAL SYSTEMS WITH RESPECT TO VDB TOPOLOGICAL INDICES
Revista de Matemática: Teoría y Aplicaciones, 2017 In this paper we give a complete description of the ordering relations in the set of catacondensed hexagonal systems, with respect to a vertex-degree-based topological index. As a consequence, extremal values of vertex-degree-based topological indices in
Juan Rada
doaj +1 more source
FEBS Open Bio, EarlyView.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
Degree resistance distance of unicyclic graphs [PDF]
Transactions on Combinatorics, 2012 Let G be a connected graph with vertex set V(G). The degree resistance distance of G is defined as the sum over all pairs of vertices of the terms [d(u)+d(v)] R(u,v), where d(u) is the degree of vertex u, and R(u,v) denotes the resistance distance ...
Ivan Gutman, Linhua Feng, Guihai Yu
doaj
ON THE DISTRIBUTION OF THE SECOND DEGREES OF CONFIGURATION GRAPHS VERTICES
Transactions of the Karelian Research Centre of the Russian Academy of Sciences, 2019 The object is configuration graphs with N vertices, numbered from 1 to N, whosevertex degrees are independent identically distributed random variables.
Elena Khvorostyanskaya
doaj +1 more source
Almost sure convergence of vertex degree densities in the vertex splitting model [PDF]
Stochastic Models, 2016 1 ...
Stefánsson, Sigurdur Örn +1 more
openaire +2 more sources
Comparative assessment of crystallographic and cryo‐EM models in the Protein Data Bank
FEBS Open Bio, EarlyView.Raw data obtained by X‐ray crystallography or cryo‐EM result in experimental maps, ultimately fitted by atomic models. Although the physical principles are different, the final results can be viewed, compared, and evaluated in the same way. With cryogenic electron microscopy (cryo‐EM) on track to surpass X‐ray crystallography as the preferred method ...
Alexander Wlodawer +7 more
wiley +1 more source
Non-solvable Groups whose Character Degree Graph has a Cut-Vertex. I [PDF]
, 2023 Let G be a finite group. Denoting by the set of degrees of the irreducible complex characters of G, we consider the character degree graph of G: this is the (simple undirected) graph whose vertices are the prime divisors of the numbers in , and two ...
Dolfi, Silvio +11 more
core +1 more source
Novel Face Index for Benzenoid Hydrocarbons
Mathematics, 2020 A novel topological index, the face index ( F I ), is proposed in this paper. For a molecular graph G, face index is defined as F I ( G ) = ∑ f ∈ F ( G ) d ( f ) = ∑ v ∼ f , f ∈ F ( G ) d ( v ...
Muhammad Kamran Jamil +2 more
doaj +1 more source
Vertex degrees of planar graphs
Journal of Combinatorial Theory, Series B, 1979 AbstractLet G be a planar graph having n vertices with vertex degrees d1, d2,…,dn. It is shown that Σi=1ndi2 ≤ 2n2 + O(n). The main term in this upper bound is best possible.
openaire +2 more sources