Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
On sombor index of m-shadow graph of some graphs
View through CrossRef
This new topological invariant is applied in the areas of chemical graph theory. In this paper we have obtained the Sombor index of m−shadow graphs of path graph Dm(Pn), cycle graph Dm(Cn), ladder graph Dm(Ln) and tadpole graph Dm(Tn,p). We have also concluded that, the Sombor index of m-shadow graph of any regular or finite connected graph G is SO(G)m3
Title: On sombor index of m-shadow graph of some graphs
Description:
This new topological invariant is applied in the areas of chemical graph theory.
In this paper we have obtained the Sombor index of m−shadow graphs of path graph Dm(Pn), cycle graph Dm(Cn), ladder graph Dm(Ln) and tadpole graph Dm(Tn,p).
We have also concluded that, the Sombor index of m-shadow graph of any regular or finite connected graph G is SO(G)m3.
Related Results
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...
Sombor Index and Sombor Polynomial of the Noncommuting Graph Associated to Some Finite Groups
Sombor Index and Sombor Polynomial of the Noncommuting Graph Associated to Some Finite Groups
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 o...
Data Analytics on Graphs Part I: Graphs and Spectra on Graphs
Data Analytics on Graphs Part I: Graphs and Spectra on Graphs
The area of Data Analytics on graphs promises a paradigm shift, as we approach information processing of new classes of data which are typically acquired on irregular but structure...
Twilight graphs
Twilight graphs
AbstractThis paper deals primarily with countable, simple, connected graphs and the following two conditions which are trivially satisfied if the graphs are finite:(a) there is an ...
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...
On the reciprocal distance spectrum of edge corona of graphs
On the reciprocal distance spectrum of edge corona of graphs
The reciprocal distance spectrum (Harary spectrum) of a connected graph [Formula: see text] is the multiset of eigenvalues of its reciprocal distance matrix (Harary matrix) [Formul...
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...