Results 41 to 50 of about 91 (73)
Sharp Upper Bounds on the Clar Number of Fullerene Graphs
The Clar number of a fullerene graph with n vertices is bounded above by ⌊n/6⌋ − 2 and this bound has been improved to ⌊n/6⌋ − 3 when n is congruent to 2 modulo 6.
Gao Yang, Zhang Heping
doaj +1 more source
THE SECOND EDGE-WIENER INDEX OF SOME COMPOSITE GRAPHS
In this paper we study the behavior of the second edge-Wiener index under the join and corona product of graphs. Results are applied for some classes of graphs such as suspensions, bottlenecks, and thorny graphs.
M. Azari, A. Iranmanesh
semanticscholar +1 more source
SCHULTZ AND GUTMAN INDICES FOR GRAPH COMPLEMENTS
A graph G is said to have property (*) [4] if for every pair of its adjacent vertices u and v there exists a vertex w such that w is not adjacent to u and v.
S. Ramakrishnan, J. Babujee
semanticscholar +1 more source
Topological Indices of Para-line Graphs of V-Phenylenic Nanostructures
The degree-based topological indices are numerical graph invariants which are used to correlate the physical and chemical properties of a molecule with its structure.
Nadeem Imran +3 more
doaj +1 more source
For a graph Q=(V,E){\mathbb{Q}}=\left({\mathbb{V}},{\mathbb{E}}), the transformation graph are defined as graphs with vertex set being V(Q)∪E(Q){\mathbb{V}}\left({\mathbb{Q}})\cup {\mathbb{E}}\left({\mathbb{Q}}) and edge set is described following ...
Ali Parvez +5 more
doaj +1 more source
In graph theory, the Randic index (R) is a topological graph invariant widely used as a physicochemical descriptor in the mathematical modeling of molecular structures. However, traditional molecular graphs fail to capture the heterogeneity of chemical bonds, since they treat all edges as uniform, ignoring variations in bond lengths and strengths.
Ying Wang +5 more
wiley +1 more source
Extremal Values on the General Degree–Eccentricity Index of Unicyclic Graphs of Fixed Diameter
For a connected graph G and two real numbers a, b, the general degree–eccentricity index of G is given by DEIa,bG=∑v∈VGdGavecGbv, where V(G) represent the vertex set of graph G, dG(v) denotes the degree of vertex v, and ecG(v) is the eccentricity of v in G, that is, the maximum distance from v to another vertex of G. This index generalizes several well‐
Mesfin Masre, G. Muhiuddin
wiley +1 more source
Computing Some Topological Indices of Two Kinds of Dendrimer Graphs G[n] and H[n]
Dendrimer molecules are macromolecules which have many applications in nanosciences, drug delivery, biology, and different areas of sciences. Topological indices of chemical graph theory are numerical descriptor of a molecular structure. The dendrimer graph G[n] is obtained by attaching the new paths P9, joined each pendant vertex of G[n − 1] to ...
Hojat Kaviani +2 more
wiley +1 more source
Upper bounds for the global cyclicity index
We find new upper bounds for the global cyclicity index, a variant of the Kirchhoff index, and discuss the wide family of graphs for which the bounds are attained.
Palacios José Luis
doaj +1 more source
Synthesis and properties of octahedral silsesquioxane with vinyl acetate side group
A new type of octa polyhedral oligomeric silsesquioxane (Octa DMS-POSS) has been obtained. The synthesized Octa DMS-POSS is further modified with vinyl acetate in order to obtain a vinyl acetate-polyhedral oligomeric silsesquioxane (VAPOSS) with a better
Wang Xiaorong +3 more
doaj +1 more source

