Affiliation:
1. Department of Applied Sciences, University of Technology, Baghdad 10066/UTC+3, Iraq
Abstract
In this paper, selected domination parameters are discussed and proved especially after expanding the graph by duplicating vertices or edges. The tadpole domination number after expansion is obtained in terms of the old tadpole domination number and the maximal path of the original graph, tadpole domination number was determined for any graph after the duplication of the order of the vertices set of G or the duplication of the size of the edges set. Determining if a graph is Hamiltonian is much more problematic. Therefore, the leading outcome in this paper is that we provide that if an expanded graph (by duplicating each vertex by an edge) has tadpole domination, then the original (initial) graph has Hamiltonian path and vice versa.
Publisher
World Scientific Pub Co Pte Lt
Subject
Discrete Mathematics and Combinatorics
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Total equality Co-neighborhood domination in a graph;INTERNATIONAL CONFERENCE OF COMPUTATIONAL METHODS IN SCIENCES AND ENGINEERING ICCMSE 2021;2023
2. Tadpole domination number of graphs;Discrete Mathematics, Algorithms and Applications;2022-12-12
3. Rings domination in graphs;INT J NONLINEAR ANAL;2022
4. Inverse whole domination in graphs;3RD INTERNATIONAL SCIENTIFIC CONFERENCE OF ALKAFEEL UNIVERSITY (ISCKU 2021);2022
5. Total co-even domination in graphs in some of engineering project theoretically;3RD INTERNATIONAL SCIENTIFIC CONFERENCE OF ALKAFEEL UNIVERSITY (ISCKU 2021);2022