On Degree Dominating Functions in Graphs
Article Sidebar
Main Article Content
Abstract
A set S the number of vertices in a graph G is said to be a dominating set if every vertex in V-S is adjacent to some vertex in S. A degree dominating function (DDF ) is a function f: V(G) | {0,1,2,3,..., , Triangle (G) + 1} having the property that every vertex v of S is assigned with deg (v) + 1 and all remaining vertices with zero. The weight of a degree dominating function f is defined by w(f) = Sigma v is an element of S (deg(v) + 1). The degree domination number, denoted by y deg (G), is the minimum weight of all possible DDFs. In this paper, we extended the study of the degree domination number of some classes of graphs.
Downloads
Article Details
Section
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
How to Cite
References
C. Berge: Theory of Graphs and its Applications, Methuen and Co.Ltd, London 1962. https://www.sciepub.com/reference/175421
N.C. Demirpolat, and E. Kilic, On Degree Domination in Graph, J. of Modern Technology and Eng. 9(2),(2024),112-118. DOI
: https://doi.org/10.62476/jmte9112
M. Dinorog and I.S. Cabahug, Ring Domination Number of Some Mycielski Graphs, Asian Research J. of Mathematics, 18(12), (2022).
T. W. Haynes, S. T. Hedetniemi and P. J. Slater, "Fundamentals of domination in Graphs", Marcel Dekker, New-York 1998.
P. Mahalank, S.O. Yildirim, F.E. Zihni, B.K. Majni and I.N. Cangul, Some topological indices of Pentagonal Double chains, ITM Web of Conf. 49, 01004 (2022) Fourth ICAMNM 2022.