آمار

تعداد نشریات8
تعداد شماره‌ها430
تعداد مقالات5,590
تعداد مشاهده مقاله7,014,610
تعداد دریافت فایل اصل مقاله5,998,184
Alikhani, Saeid, Ghanbari, Nima. (1403). Strong domination number of a modified graph. نشریه مهندسی عمران امیرکبیر, 5(3), 217-223. doi: 10.22060/ajmc.2023.22327.1152
Saeid Alikhani; Nima Ghanbari. "Strong domination number of a modified graph". نشریه مهندسی عمران امیرکبیر, 5, 3, 1403, 217-223. doi: 10.22060/ajmc.2023.22327.1152
Alikhani, Saeid, Ghanbari, Nima. (1403). 'Strong domination number of a modified graph', نشریه مهندسی عمران امیرکبیر, 5(3), pp. 217-223. doi: 10.22060/ajmc.2023.22327.1152
Alikhani, Saeid, Ghanbari, Nima. Strong domination number of a modified graph. نشریه مهندسی عمران امیرکبیر, 1403; 5(3): 217-223. doi: 10.22060/ajmc.2023.22327.1152

Strong domination number of a modified graph

AUT Journal of Mathematics and Computing
دوره 5، شماره 3، 2024، صفحه 217-223    اصل مقاله (433.52 K)
نوع مقاله: Original Article
شناسه دیجیتال (DOI): 10.22060/ajmc.2023.22327.1152
نویسندگان
Saeid Alikhani* 1؛ Nima Ghanbari2
1Department of Mathematical Science, Yazd University, 89195-741, Yazd, Iran
2Department of Informatics, University of Bergen, P.O. Box 7803, 5020 Bergen, Norway
چکیده
Let $G=(V,E)$ be a simple graph. A set $D\subseteq V$ is a strong dominating set of $G$, if for every vertex $x\in V\setminus D$ there is a vertex $y\in D$ with $xy\in E(G)$ and $\deg(x)\leq \deg(y)$. The strong domination number $\gamma_{\rm st}(G)$ is defined as the minimum cardinality of a strong dominating set. In this paper, we study the effects on $\gamma_{\rm st}(G)$ when $G$ is modified by operations on vertices and edges of $G$.
کلیدواژه‌ها
Strong domination number؛ Strong dominating set؛ Vertex contraction
مراجع
  1. Akbari, S. Alikhani, and Y.-h. Peng, Characterization of graphs using domination polynomials, European J. Combin., 31 (2010), pp. 1714–1724.
  2. Alikhani and E. Deutsch, More on domination polynomial and domination root, Ars Combin., 134 (2017), pp. 215–232.
  3. Alikhani, N. Ghanbari, and H. Zaherifar, Strong domination number of some operations on a graph, Commun. Comb. Optim., (2023), pp. 1–11.
  4. Alikhani and Y.-h. Peng, Introduction to domination polynomial of a graph, Ars Combin., 114 (2014), pp. 257–266.
  5. Boutrig and M. Chellali, A note on a relation between the weak and strong domination numbers of a graph, Opuscula Math., 32 (2012), pp. 235–238.
  6. W. Haynes, S. T. Hedetniemi, and P. J. Slater, Fundamentals of domination in graphs, vol. 208 of Monographs and Textbooks in Pure and Applied Mathematics, Marcel Dekker, Inc., New York, 1998.
  7. Sampathkumar and L. P. Latha, Strong weak domination and domination balance in a graph, Discrete Math., 161 (1996), pp. 235–242.
  8. Yi, Bounds on the sum of broadcast domination number and strong metric dimension of graphs, Discrete Math. Algorithms Appl., 12 (2020), pp. 2050010, 14.
  9. Zaherifar, S. Alikhani, and N. Ghanbari, On the strong dominating sets of graphs, J. Algebr. Syst., 11 (2023), pp. 65–76.
آمار
تعداد مشاهده مقاله: 425
تعداد دریافت فایل اصل مقاله: 502


سامانه مدیریت نشریات علمی. طراحی و پیاده سازی از سیناوب