Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
Chemical applicability and curvilinear regression models of vertex-degree-based topological index: Elliptic Sombor index
View through CrossRef
Abstract
Chemical graph theory facilitates different tools that have significant applications in drug design and development. Recently Gutman et al., introduced a novel vertex-degree-based topological index called Elliptic Sombor index and its application through geometric approach. This article focusses on chemical applicability of Elliptic Sombor index through regression models using 22 benzenoid hydrocarbons. In this process, the chemical applicability of Elliptic Sombor index with various physicochemical properties of benzenoid hydrocarbons through curvilinear regression models is carried out. The data of the statistical analysis shows that Elliptic Sombor index is potential predictive index for the property Polarizability.
Title: Chemical applicability and curvilinear regression models of vertex-degree-based topological index: Elliptic Sombor index
Description:
Abstract
Chemical graph theory facilitates different tools that have significant applications in drug design and development.
Recently Gutman et al.
, introduced a novel vertex-degree-based topological index called Elliptic Sombor index and its application through geometric approach.
This article focusses on chemical applicability of Elliptic Sombor index through regression models using 22 benzenoid hydrocarbons.
In this process, the chemical applicability of Elliptic Sombor index with various physicochemical properties of benzenoid hydrocarbons through curvilinear regression models is carried out.
The data of the statistical analysis shows that Elliptic Sombor index is potential predictive index for the property Polarizability.
Related Results
Results on the elliptic Sombor index
Results on the elliptic Sombor index
The newly introduced elliptic Sombor index of a graph $G$ is defined as follows[[EQUATION]]
in which $E$ and $d(u)$ are the edge set of $G$ and the degree of the ...
Differential graded vertex Lie algebras
Differential graded vertex Lie algebras
This is the continuation of the study of differential graded (dg) vertex algebras defined in our previous paper [Caradot et al., “Differential graded vertex operator algebras and t...
Selection of Injectable Drug Product Composition using Machine Learning Models (Preprint)
Selection of Injectable Drug Product Composition using Machine Learning Models (Preprint)
BACKGROUND
As of July 2020, a Web of Science search of “machine learning (ML)” nested within the search of “pharmacokinetics or pharmacodynamics” yielded over 100...
Distinguishing between topological isomorphism and topological equivalence of power electronic converters
Distinguishing between topological isomorphism and topological equivalence of power electronic converters
In the process of deducing the topology of power electronic converters, scholars often use topological equivalence or topological isomorphism to identify topologies with different ...
Reprogrammable plasmonic topological insulators with ultrafast control
Reprogrammable plasmonic topological insulators with ultrafast control
Abstract
Topological photonics has revolutionized our understanding of light propagation, providing a remarkably robust way to manipulate light. Despite the intensive resea...
On the product of Sombor and modified Sombor indices
On the product of Sombor and modified Sombor indices
The Sombor index (\(SO\)) and the modified Sombor index (\(^mSO\)) are two closely related vertex-degree-based graph invariants. Both were introduced in the 2020s, and have already...
THE FORCING EDGE FIXING EDGE-TO-VERTEX MONOPHONIC NUMBER OF A GRAPH
THE FORCING EDGE FIXING EDGE-TO-VERTEX MONOPHONIC NUMBER OF A GRAPH
For a connected graph G = (V, E), a set Se ⊆ E(G)–{e} is called an edge fixing edge-to-vertex monophonic set of an edge e of a connected graph G if every vertex of G lies on an e –...
BILANGAN KROMATIK EQUITABLE PADA GRAF BINTANG, GRAF LOLIPOP, DAN GRAF PERSAHABATAN
BILANGAN KROMATIK EQUITABLE PADA GRAF BINTANG, GRAF LOLIPOP, DAN GRAF PERSAHABATAN
Let G be a connected and undirected graph. Vertex coloring in a graph G is a mapping from the set of vertices in G to the set of colors such that every two adjacent vertices have d...