Results 41 to 50 of about 39,174 (128)

The Product Connectivity Banhatti Index of A Graph

open access: yesDiscussiones Mathematicae Graph Theory, 2019
Let G = (V, E) be a connected graph with vertex set V (G) and edge set E(G). The product connectivity Banhatti index of a graph G is defined as, PB(G)=∑ue1dG(u)dG(e)$PB(G) = \sum\nolimits_{ue} {{1 \over {\sqrt {{d_G}(u){d_G}(e)} }}}$ where ue means that ...
Kulli V.R.   +2 more
doaj   +1 more source

On Entropy Measures and Eccentricity-Based Descriptors of Polyamidoamine (PAMAM) Dendrimers

open access: yesJournal of Chemistry, 2022
Topological indices (TIs) assign a numeric value to a graph or a molecular structure. Due to their ability to predict the physiochemical properties of a molecular graph, several TIs have been introduced and studied, mainly based on degree and distance ...
Zhi-Hao Hui   +6 more
doaj   +1 more source

Forgotten Index and Forgotten Coindex of Graphs

open access: yesمجلة بغداد للعلوم
F index is a connected graph, sum of the cubes of the vertex degrees. The forgotten topological index has been designed to be employed in the examination of drug molecular structures, which is extremely useful for pharmaceutical and medical experts in ...
J. Senbaga Malar , A. Meenakshi
doaj   +1 more source

Some new upper bounds for the inverse sum indeg index of graphs

open access: yesElectronic Journal of Graph Theory and Applications, 2020
Let G = (V,E) be a simple connected graph with the vertex set V = {1,2,...,n} and sequence of vertex degrees (d1,d2,...,dn) where di denotes the degree of a vertex i ∈ V. With i ∼ j, we denote the adjacency of the vertices i and j in the graph G.
Akbar Ali   +3 more
doaj   +1 more source

Two Dimensional Descriptors Based on Degree, Neighborhood Degree, and Reverse Degree for HEX (Hexagonal) Lattice

open access: yesJournal of Mathematics, 2022
Crystal structures are of great scrutiny due to the elegant and well-ordered symmetry that influences a significant role in determining numerous physical properties.
Asima Razzaque   +3 more
doaj   +1 more source

Eccentricity based graph parameters of subdivision-vertex-vertex (edge-edge) join products

open access: yesAin Shams Engineering Journal
Effective utilization of graph products are essential for the development of complex networking systems. The graph product can produce a diverse array of fundamental graphs as an application.
Anam Shahzad   +4 more
doaj   +1 more source

Maximal tree and unicylic graph for Euler Sombor index with given diameter

open access: yesAKCE International Journal of Graphs and Combinatorics
The study of topological descriptors is essential for understanding the underlying structures of graphs and networks. Numerous numerical descriptors associated with graphs have been used to analyze their overall structure.
Zahid Raza   +3 more
doaj   +1 more source

Extremal unicyclic and bicyclic graphs with respect to the -index

open access: yesAKCE International Journal of Graphs and Combinatorics, 2017
In the study of structure-dependency of the total -electron energy in 1972, it was shown that this energy depends on the degree based sum and , where is the degree of a vertex of under consideration molecular graph .
Shehnaz Akhter   +2 more
doaj   +1 more source

Extremal properties of connected 4-cyclic graphs of a topological index related to chemical graphs

open access: yesScience Progress
Augmented Zagreb index (AZI) is an important vertex-degree-based topological index with many applications especially in chemistry. In this article, minimum value of A Z I ( G ) is obtained and the corresponding extremal graph is characterized in the ...
Riffat Rehman   +3 more
doaj   +1 more source

Computing degree based topological indices of algebraic hypergraphs

open access: yesHeliyon
Topological indices are numerical parameters that indicate the topology of graphs or hypergraphs. A hypergraph H=(V(H),E(H)) consists of a vertex set V(H) and an edge set E(H), where each edge e∈E(H) is a subset of V(H) with at least two elements.
Amal S. Alali   +4 more
doaj   +1 more source

Home - About - Disclaimer - Privacy