Odd-Sum Domination in Graphs
Advances in Nonlinear Variational Inequalities · 18.12.2024 · 28 (3s) · 689-694
DOI: 10.52783/anvi.v28.7159 ↗Kurz gefasst
Fachartikel in der Zeitschrift Advances in Nonlinear Variational Inequalities, online erschienen am 18.12.2024. Verfasst von Saloni R. Kundaliya,.
Abstract (Originalsprache)
Let be a connected, finite and undirected graph. A set is an odd-sum dominating set if for every vertex , there exists at least one neighbour such that the sum of their degrees is odd. The minimum cardinality of odd-sum dominating set of graph is called odd-sum domination number and it is denoted by . In this paper we initiate a study of this new parameter. We determine the odd-sum domination number for some families of standard graphs.
Zitieren
APA
Kundaliya,, S. R. (2024). Odd-Sum Domination in Graphs. Advances in Nonlinear Variational Inequalities, 28(3s), 689-694. https://doi.org/10.52783/anvi.v28.7159
Vancouver
Kundaliya, SR. Odd-Sum Domination in Graphs. Advances in Nonlinear Variational Inequalities. 2024;28(3s):689-694. doi:10.52783/anvi.v28.7159
BibTeX
@article{Kundaliya2024,
author = {Kundaliya,, Saloni R.},
title = {Odd-Sum Domination in Graphs},
journal = {Advances in Nonlinear Variational Inequalities},
year = {2024},
volume = {28},
number = {3s},
pages = {689--694},
doi = {10.52783/anvi.v28.7159}
}
EUVIMED