Javascript must be enabled to continue!
Lower Domination Polynomial of a Graph
View through CrossRef
In literature, we find many topological indices based on the degree of the vertex. In this article, we initiate the study of a new index which takes into account, the smallest dominating set involving a vertex. This is called as lower domination number of a graph relative to a vertex. Using this lower domination number of a graph relative to a vertex, we have introduced new indices called Lower Domination Index and Lower Domination coindex of a graph. We have obtained the relation between these indices and co-indices for a general graph and these indices have been obtained for different graphs and their derived graphs. A new graph polynomial called Lower Domination Polynomial has been introduced and is obtained for some standard graphs.
Title: Lower Domination Polynomial of a Graph
Description:
In literature, we find many topological indices based on the degree of the vertex.
In this article, we initiate the study of a new index which takes into account, the smallest dominating set involving a vertex.
This is called as lower domination number of a graph relative to a vertex.
Using this lower domination number of a graph relative to a vertex, we have introduced new indices called Lower Domination Index and Lower Domination coindex of a graph.
We have obtained the relation between these indices and co-indices for a general graph and these indices have been obtained for different graphs and their derived graphs.
A new graph polynomial called Lower Domination Polynomial has been introduced and is obtained for some standard graphs.
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...
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...
Completion and decomposition of hypergraphs by domination hypergraphs
Completion and decomposition of hypergraphs by domination hypergraphs
A graph consists of a finite non-empty set of vertices and a set of unordered pairs of vertices, called edges. A dominating set of a graph is a set of vertices D such that every ve...
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...
CYCLE DOMINATION POLYNOMIAL OF A GRAPH
CYCLE DOMINATION POLYNOMIAL OF A GRAPH
Let $G(V, E)$ be a simple connected finite graph. Then a Hamilton path in a graph is a path that reaches every vertex, and a Hamilton cycle is a cycle that reaches every vertex. A ...
Bilangan Terhubung Titik Pelangi pada Graf Garis dan Graf Tengah dari Hasil Operasi Comb Graf Bintang C<sub>3</sub> dan Graf Bintang S<sub>n</sub>
Bilangan Terhubung Titik Pelangi pada Graf Garis dan Graf Tengah dari Hasil Operasi Comb Graf Bintang C<sub>3</sub> dan Graf Bintang S<sub>n</sub>
Penelitian ini bertujuan menentukan bilangan terhubung titik pelangi (rainbow vertex connection number) pada graf garis dan graf tengah yang diperoleh dari hasil operasi comb antar...
Complexity Theory
Complexity Theory
The workshop
Complexity Theory
was organised by Joachim von zur Gathen (Bonn), Oded Goldreich (Rehovot), Claus-Peter Schnorr (Frankfurt), an...
Akar-akar Polinomial Separable sebagai Pembentuk Perluasan Normal pada Ring Modulo
Akar-akar Polinomial Separable sebagai Pembentuk Perluasan Normal pada Ring Modulo
One of the most important uses of the ring and field theory is an extension of a broader field so that a polynomial can be found to have roots. In this study researchers took modul...

