Akademik Veri Yönetim Sistemi
Boletim da Sociedade Paranaense de Matematica, cilt.43, 2025 (ESCI, Scopus)
Let G = (V, E) be a graph of order n and let B(D) be the set of vertices in V \ D that have a neighbor in the vertex set D. The independent differential of an independent vertex set D is defined as ∂i(D) = |B(D)|− |D| and the maximum value of ∂i(D) for any independent subset D of V is the independent differential of G. An independent set S of vertices of a graph G is said to be an independent dominating set if every vertex in V \ S is adjacent to a vertex in S. G is an independent dominant differential graph if it contains a ∂i-set which is also an independent dominating set. In this paper, the study on properties of ∂i(G) is initiated and some upper and lower bounds on ∂i(G) are presented. This paper is devoted to the computation of independent differential of wheel, cycle, path-related graphs, and graph operations. Furthermore, independent dominant differential graph types are recognized.