EDP Sciences logo
Web of Conferences logo
Search
Menu
All issues Volume 376 (2026) EPJ Web Conf., 376 (2026) 06004 References
Open Access
Issue
EPJ Web Conf.
Volume 376, 2026
6th International Conference on Recent Advances in Mechanical Engineering and Nanomaterials (ICRAMEN 2026)
Article Number 06004
Number of page(s) 9
Section Recent Advances in Science & Engineering
DOI https://doi.org/10.1051/epjconf/202637606004
Published online 01 July 2026
  1. T. W. Haynes, S. T. Hedetniemi, and P. J. Slater, Fundamentals of Domination in Graphs (Marcel Dekker, New York, 1998). [Google Scholar]
  2. N. Biggs, E. K. Lloyd, and R. J. Wilson, Graph Theory 1736-1936 (Clarendon Press, Oxford, 1976). [Google Scholar]
  3. M. Dettlaff, M. Lemańska, and J. Topp, Certified domination, AKCE Int. J. Graphs Comb. 17, 86- (2020). [Google Scholar]
  4. A. I. Lone and V. S. Goswami, Connected certified domination number of certain graphs, AIP Conf. Proc. 2617, 040028- (2023). [Google Scholar]
  5. A. Ilyass and N. Mani, Connected certified domination in graphs: Properties and algorithmic aspects, Commun. Math. Appl. 15, 817- (2024). [Google Scholar]
  6. J. Wu and H. Li, "On Calculating Connected Dominating Set for Efficient Routing in Ad Hoc Wireless Networks, " Proceedings of DIALM, (1999). [Google Scholar]
  7. J. Wu and F. Dai, "A Generic Distributed Broadcast Scheme in Ad Hoc Wireless Networks, " IEEE Transactions on Computers, (2004). [Google Scholar]
  8. M. Lemańska, M. Miotk, J. Topp, and P. Żyliński, Certified domination number of a graph, Opuscula Math. 39, 815- (2019). [Google Scholar]
  9. S. D. Raj and S. G. S. Kumari, Certified domination number in product of graphs, Turkish J. Comput. Math. Educ. 11, 1166- (2020). [Google Scholar]
  10. D. B. West, Introduction to Graph Theory, 2nd ed. (Prentice Hall, Upper Saddle River, NJ, 2001). [Google Scholar]
  11. C. Jayasekaran and S. V. Ashwin Prakash, Connected certified domination number of splitting graphs of certain graphs, Int. J. Intell. Syst. Appl. Eng. 12, 1047 (2024). [Google Scholar]
  12. M. C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, 2nd ed. (Elsevier, Amsterdam, 2004)P. K. Jakkepalli, S. Arumugam, H. Khandelwal, and V. S. Reddy, Algorithmic aspects of certified domination in graphs, Commun. Comb. Optim. 7, 247 (2022). [Google Scholar]
  13. G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccamela and M. Protasi, Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties (Springer, Berlin, 1999). [Google Scholar]
  14. H. Hamja, Certified perfect domination in graphs, Eur. J. Pure Appl. Math. 16, 1121 (2023). [Google Scholar]
  15. A. I. Lone and V. Goswami, Connected certified domination edge critical and stable graphs, Acta Univ. Sapientiae Inf. 15, 25 (2023). [Google Scholar]
  16. M. Miotk, Certified domination critical graphs upon vertex removal, Utilitas Math. 123, 179 (2025). [Google Scholar]
  17. T. W. Haynes, S. T. Hedetniemi, and P. J. Slater, Domination in Graphs: Advanced Topics, Marcel Dekker, New York, 1998. [Google Scholar]
  18. C. H. Papadimitriou and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity (Dover Publications, Mineola, NY, 1998) [Google Scholar]
  19. S. Guha and S. Khuller, Approximation algorithms for connected dominating sets, Algorithmica 20, 374- (1998). [Google Scholar]
  20. E. J. Cockayne and S. T. Hedetniemi, Towards a theory of domination in graphs, Networks 7, 247- (1977). [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.