Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
Extremal Chemical Graphs of Maximum Degree at Most 3 for 33 Degree-Based Topological Indices
View through CrossRef
We consider chemical graphs that are defined as connected graphs of maximum degree at most 3. We characterize the extremal ones, that is, those that maximize or minimize 33 degree-based topological indices. This study shows that five graph families are sufficient to characterize the extremal chemical graphs of 29 of these 33 indices. In other words, the extremal properties of this set of degree-based topological indices vary very little.
University Library in Kragujevac
Title: Extremal Chemical Graphs of Maximum Degree at Most 3 for 33 Degree-Based Topological Indices
Description:
We consider chemical graphs that are defined as connected graphs of maximum degree at most 3.
We characterize the extremal ones, that is, those that maximize or minimize 33 degree-based topological indices.
This study shows that five graph families are sufficient to characterize the extremal chemical graphs of 29 of these 33 indices.
In other words, the extremal properties of this set of degree-based topological indices vary very little.
Related Results
Topological Descriptors on Some Families of Graphs
Topological Descriptors on Some Families of Graphs
In view of the successful applications of graph theory, relationships between the biological activity and chemical structure have been developed. One of the popular topics in graph...
Computation of Topological Indices of Some Special Graphs
Computation of Topological Indices of Some Special Graphs
There are several chemical indices that have been introduced in theoretical chemistry to measure the properties of molecular topology, such as distance-based topological indices, d...
Independent Set in Neutrosophic Graphs
Independent Set in Neutrosophic Graphs
New setting is introduced to study neutrosophic independent number and independent neutrosophic-number arising neighborhood of different vertices. Neighbor is a key term to have th...
Failed Independent Number in Neutrosophic Graphs
Failed Independent Number in Neutrosophic Graphs
New setting is introduced to study neutrosophic failed-independent number and failed independent neutrosophic-number arising neighborhood of different vertices. Neighbor is a key t...
General vertex-degree-based topological indices of Graphene Oxide (C 140 H 42 O 20 ) graphs with advanced entropies
General vertex-degree-based topological indices of Graphene Oxide (C 140 H 42 O 20 ) graphs with advanced entropies
Abstract
Nanomaterials have been widely used in a number of sectors during the past few decades, including electronics, pharmaceuticals , cosmetics, food processing, constr...
Computing a Minimum Subset Feedback Vertex Set on Chordal Graphs Parameterized by Leafage
Computing a Minimum Subset Feedback Vertex Set on Chordal Graphs Parameterized by Leafage
Abstract
Chordal graphs are characterized as the intersection graphs of subtrees in a tree and such a representation is known as the tree model. Restricting the characteriz...
Analysis of Hanoi graph by using topological indices
Analysis of Hanoi graph by using topological indices
One of the main challenges in molecular science is to model a chemical complex and predict its thermochemical properties. Various researchers have developed a number of hypothetica...
Extremal Gourava indices of unicyclic graphs
Extremal Gourava indices of unicyclic graphs
Abstract
Topological indices are useful molecular descriptors to measure Quantitative Structure-Activity Relationship (QSAR), Quantitative Structure-Property Relationship (...