SavedAdd your journal

Journals / Turkish Journal of Mathematics and Computer Science / 2026 / Volume: 11 Special Issue

Total Domination Number of Regular Dendrimer Graph

Ümmügülsüm Şener(selçuk üniversitesi)0000-0002-9801-187X
Bünyamin Şahin(selçuk üniversitesi)0000-0003-1094-5481
Pages
—
Publication Date
2019-12-30
DOI
—
🏛️Bibliographic metadata and full text access for this article are provided via DergiPark.
DergiPark Record ↗
✨

AI Summary & Key Takeaways

AI Insight
⚡ TL;DR(Too Long; Didn't Read)

New equations are obtained for regular dendrimers by using geometric series properties.

📌 3 Key Takeaways

🎯
Objective & Hypothesis:In this paper total domination number is calculated for regular dendrimer graph.
📊
Key Findings & Data:In this paper total domination number is calculated for regular dendrimer graph.
💡
Conclusion & Impact:New equations are obtained for regular dendrimers by using geometric series properties.
🔬Design:Conference Paper
📍Scope:Comprehensive Sample
⚙️Variables:domination · total domination

Abstract

In this paper total domination number is calculated for regular dendrimer graph. New equations are obtained for regular dendrimers by using geometric series properties.

🔖

Cite This Article

Şener, Ü., Şahin, B. (2019). Total Domination Number of Regular Dendrimer Graph. Turkish Journal of Mathematics and Computer Science, Volume: 11 Special Issue. https://ajindex.com/articles/1324875

📄 Full Text PDF Viewer

📄

PDF görüntüleyici hazırlanıyor...

References (10)

  1. Gao, Y., Zhu, E., Shao, Z., Gutman, I., Klobucar, A., {\em Total domination and open packing in some chemical graphs}, Journal of Mathematical Chemistry, \textbf{56}(2018), 1481--1492.
  2. Haynes, T.W., Hedetniemi, S.T., Slater, P.J., Fundamentals of Domination in Graphs, Marcel Dekker, New York, 1998.
  3. Haynes, T.W., Hedetniemi, S.T., Slater, P.J. (eds), Domination in Graphs: Advanced Topics, Marcel Dekker, New York, 1998.
  4. Hutchinson, L., Kamat, V., Larson, C.E., Mehta, S., Muncy, D., Van Cleemput, N., {\em Automated Conjecturing VI: Domination number of benzenoids}, MATCH Commun. Math. Comput. Chem., \textbf{80}(2018), 821--834.
  5. Majstorovic, S., Doslic, T., Klobucar, A., {\em k-domination on hexagonal cactus chains},Kragujevac Journal of Mathematics, \textbf{2}(2012), 335--347.
  6. Nagar, A.K., Sriam, S., {\em On eccentric connectivity index of eccentric graph of regular dendrimer}, Mathematics in Computer Science, \textbf{10}(2016), 229--237.
  7. Newkome, G.R., Moorefield, C.N., Vogtle, F., Dendrimers and Dendrons: Concepts, Syntheses, Applications, Wiley-VCH, verlag GmbH and Co.KGaA, 2002.
  8. Quadras, J., Mahizl, A.S.M., Rajasingh, I., Rajan, R.S., {\em Domination in certain chemical graphs}, J. Mathematical Chemistry, \textbf{53}(2015), 207--219.
  9. \c{S}ahin, B., \c{S}ahin, A., {\em On domination type invariants of regular dendrimer}, Journal of Mathematical Nanoscience, \textbf{8(1)}(2018), 27--31.
  10. Vukicevic, D., Klobucar, A., {\em k-dominating sets on linear benzenoids and on the infinite hexagonal grid}, Croatica Chemica Acta, \textbf{80(2)}(2007), 187--191.