Search engine for discovering works of Art, research articles, and books related to Art and Culture
ShareThis
Javascript must be enabled to continue!

Sombor Index and Sombor Polynomial of the Noncommuting Graph Associated to Some Finite Groups

View through CrossRef
Sombor index is a newly developed degree-based topological index which involves the degree of the vertex in a simple connected graph. The Sombor index is known as the square root of the sum of the squared degrees of two adjacent vertices in a graph. Meanwhile, the noncommuting graph associated to a group is a graph where its vertices are the non-central elements of the group and two vertices are adjacent if and only if they do not commute. In this study, a new notion called the Sombor polynomial is introduced. Then, the general formula of the Sombor index and the Sombor polynomial of the noncommuting graph associated to some finite groups are determined by using their definitions and some preliminaries. The groups involved in this research are the dihedral groups, the quasidihedral groups, and the generalized quaternion groups. The results found can help the chemists and biologists to predict the chemical and physical properties of the molecules without involving any laboratory work.
Title: Sombor Index and Sombor Polynomial of the Noncommuting Graph Associated to Some Finite Groups
Description:
Sombor index is a newly developed degree-based topological index which involves the degree of the vertex in a simple connected graph.
The Sombor index is known as the square root of the sum of the squared degrees of two adjacent vertices in a graph.
Meanwhile, the noncommuting graph associated to a group is a graph where its vertices are the non-central elements of the group and two vertices are adjacent if and only if they do not commute.
In this study, a new notion called the Sombor polynomial is introduced.
Then, the general formula of the Sombor index and the Sombor polynomial of the noncommuting graph associated to some finite groups are determined by using their definitions and some preliminaries.
The groups involved in this research are the dihedral groups, the quasidihedral groups, and the generalized quaternion groups.
The results found can help the chemists and biologists to predict the chemical and physical properties of the molecules without involving any laboratory work.

Related Results

Domination of Polynomial with Application
Domination of Polynomial with Application
In this paper, .We .initiate the study of domination. polynomial , consider G=(V,E) be a simple, finite, and directed graph without. isolated. vertex .We present a study of the Ira...
The Effect of Vertex and Edge Removal on Sombor Index
The Effect of Vertex and Edge Removal on Sombor Index
A vertex degree based topological index called the Sombor index was recently defined in 2021 by Gutman and has been very popular amongst chemists and mathematicians. We determine t...
On general Sombor index of graphs
On general Sombor index of graphs
In this paper, we extend the recently introduced vertex-degree-based topological index, the Sombor index, and we call it general Sombor index. The general Sombor index generalizes ...
On the KG-Sombor index
On the KG-Sombor index
Introduction/purpose: Degree-based graph invariants are a type of molecular descriptor that represent the connectivity of atoms (vertices) in a molecule through bonds (edges). They...
Graph convolutional neural networks for 3D data analysis
Graph convolutional neural networks for 3D data analysis
(English) Deep Learning allows the extraction of complex features directly from raw input data, eliminating the need for hand-crafted features from the classical Machine Learning p...
Domination of polynomial with application
Domination of polynomial with application
In this paper, .We .initiate the study of domination. polynomial , consider G=(V,E) be a simple, finite, and directed graph without. isolated. vertex .We present a study of the Ira...
More on KG-Sombor index of graphs
More on KG-Sombor index of graphs
Topological indices are generally graph-invariant numerical properties that describe the topology of a graph. The KG-Sombor index, a vertex-edge version of the Sombor index, was re...
Graph data warehousing
Graph data warehousing
Over the last decade, we have witnessed the emergence of networks in a wide spectrum of application domains, ranging from social and information networks to biological and transpor...

Back to Top