SavedAdd your journal

Journals / Communications Faculty of Sciences University of Ankara Series A1 Mathematics and Statistics / 2026 / Volume: 75 Issue: 3

Strong Efficient Domination Number for Trees and Lict Graphs

Betül Atay(AĞRI İBRAHİM ÇEÇEN ÜNİVERSİTESİ)0000-0003-1964-3287
Pages
—
Publication Date
2026-09-26
🏛️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)

In this paper we obtain many exact values and some bounds regarding this parameter of some trees and their lict graphs.

📌 3 Key Takeaways

🎯
Objective & Hypothesis:For a subgraph of a vertex set of a graph to be strong efficient, all remaining vertices in the graph must have exactly one neighbor of equal or greater degree in the specified subgraph and all vertices in the specified subgraph are independent of each other.
📊
Key Findings & Data:The strong efficient domination number is the cardinality of such set with the fewest elements.
💡
Conclusion & Impact:In this paper we obtain many exact values and some bounds regarding this parameter of some trees and their lict graphs.
🔬Design:Research Article
📍Scope:Comprehensive Sample
⚙️Variables:Strong efficient domination number · tree · lict graph

Abstract

For a subgraph of a vertex set of a graph to be strong efficient, all remaining vertices in the graph must have exactly one neighbor of equal or greater degree in the specified subgraph and all vertices in the specified subgraph are independent of each other. The strong efficient domination number is the cardinality of such set with the fewest elements. In this paper we obtain many exact values and some bounds regarding this parameter of some trees and their lict graphs.

🔖

Cite This Article

Atay, B. (2026). Strong Efficient Domination Number for Trees and Lict Graphs. Communications Faculty of Sciences University of Ankara Series A1 Mathematics and Statistics, Volume: 75 Issue: 3. https://doi.org/10.31801/cfsuasmas.1730785

📄 Full Text PDF Viewer

📄

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

References (9)

  1. Bagga, K., Beineke, L., W., G., Lipman, M., and R.E., P. (1992). A survey of integrity. Discrete Appl. Math., 37:13–28.
  2. Chen, W., Lu, H., and Yeh, Y. (1997). Operations of interlaced tress and graceful trees. Southest Asian Bull. Math., 21:337–348.
  3. Cormen, T., Leiserson, C., and Rivest, R. (2022). Introduction to Algorithms. MIT Press, Cambridge.
  4. Cygan, M., Pilipczuk, M., and Skrekovski, R. (2011). Relation between randic index and average distance of trees. MATCH Commun. Math. Comput. Chem, 66(2):605–612.
  5. Harary, F. (1968). Graph Theory. Addison-Wesley Publishing.
  6. Meena, N., Subramanian, A., and Swaminathan, V. (2014). Strong efficient domination in graphs. International Journal of Innovative Science, Engineering and Technology, 1(4):172–177.
  7. Tejaswini, K., Venkanagouda, M., and Venkatesha Muddebihal, M. (2012). On the lict geodetic number of a graph. International Journal of Mathematics and Computer Applications Research, 2(3):65–69.
  8. West, D. (2002). Introduction to Graph Theory. Pearson Education.
  9. Yıldız, O. (2013). C ve JAVA ile Veri Yapılarına Giriş. Boğaziçi University Publishing.