Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
Secure equitable subdivision number of graphs
View through CrossRef
A dominating set S of a graph G(V, E) is called a secure dominating set, if for each vertex x belongs to V(G) \ S there exists at least one vertex y in S such that y belongs to the neighbourhood of x and a vertex y can be replaced by a vertex x without losing domination property. A secure dominating set S is a secure equitable dominating set if for each x in V(G) \ S and the vertex y in S, which replaces x, we have |deg(x)-deg(y)| is less than or equal to 1. In this paper, we initiate the study of a new domination parameter, the secure equitable subdivision number of graphs. Also, we introduce the definitions of the secure equitable subdivision critical graphs and the secure equitable subdivision stable graphs. Further, we study the construction of a secure equitable subdivision critical graph.
Title: Secure equitable subdivision number of graphs
Description:
A dominating set S of a graph G(V, E) is called a secure dominating set, if for each vertex x belongs to V(G) \ S there exists at least one vertex y in S such that y belongs to the neighbourhood of x and a vertex y can be replaced by a vertex x without losing domination property.
A secure dominating set S is a secure equitable dominating set if for each x in V(G) \ S and the vertex y in S, which replaces x, we have |deg(x)-deg(y)| is less than or equal to 1.
In this paper, we initiate the study of a new domination parameter, the secure equitable subdivision number of graphs.
Also, we introduce the definitions of the secure equitable subdivision critical graphs and the secure equitable subdivision stable graphs.
Further, we study the construction of a secure equitable subdivision critical graph.
Related Results
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...
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...
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...
Equitable critical graphs
Equitable critical graphs
A proper vertex coloring of a graph [Formula: see text] is equitable if the sizes of any two color classes differ by at most one. The equitable chromatic number of a graph [Formula...
The Family of Multiparameter Quaternary Subdivision Schemes
The Family of Multiparameter Quaternary Subdivision Schemes
In the field of subdivision, the smoothness increases as the arity of schemes increases. The family of high arity schemes gives high smoothness comparative to low arity schemes. In...
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...
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...
Computing the Energy of Certain Graphs based on Vertex Status
Computing the Energy of Certain Graphs based on Vertex Status
Background:
The concept of Hückel molecular orbital theory is used to compute the graph energy numerically and graphically on the base of the status of a vertex.
Objective:
Our a...