Resolving Domination Number of Degree Splitting Graph of a Graph

View at publisher Summarise with VIRAT
Authors: J. Suja, A. Nasreen Sultana
Cited by: 0

Summary

No summary yet. VIRAT can read this paper and write a plain-language summary of its aim, methods, key findings and limitations.

Summarise with VIRAT Free to try with your Science Catalogs account.

Abstract

Let G be a simple, connected, and finite graph. Any collection of vertices where every vertex of G is either in D or has at least one neighbor in D is called a dominating set D . The dominance number of G , represented as γ ( G ), is the lowest cardinality of such a set. The metric representation of v with respect to w for an ordered set https://www.w3.org/1998/Math/MathML" display="inline"> W = w 1 , w 2 , … , w k of vertices and a vertex v in a connected graph G is the k -vector https://www.w3.org/1998/Math/MathML" display="inline"> r ( v ∣ W ) = d v , w 1 , d v , w 2 , … , d v , w k , where d ( x , y ) symbolizes the distance between the vertices x and y . If different vertices of G have different representations with regard to w , then W is a resolving set (RS) for G . The cardinality of a basis for G is represented by dim ( G ), and a resolving set of minimum cardinality is referred to as a minimum RS or a basis. The resolving dominating set’s minimum cardinality is referred as the resolving domination number (RDN) is γ r ( G ). In this research, we investigate the peculiar graph’s resolving domination number.

Fields of Study & Subjects

Advanced Graph Theory Research Graph Labeling and Dimension Problems Graph theory and applications

Publication details

Journal / source
CRC Press eBooks
Pages
431–434
Publication date
31 March 2026
Language
EN
Document type
Book chapter