Generalizing TCCD-Number For Power Graph Of Some Graphs
Indian Journal Of Science And Technology · 25.04.2024 · 17 (SPI1) · 115-123
DOI: 10.17485/ijst/v17sp1.243 ↗Kurz gefasst
Fachartikel in der Zeitschrift Indian Journal Of Science And Technology, online erschienen am 25.04.2024. Verfasst von S Kaviya und 2 weiteren Autor:innen. Die Arbeit wurde bisher 3-mal zitiert (Crossref).
Abstract (Originalsprache)
Objective
Finding the triple connected certified domination number for the power graph of some peculiar graphs.
Methods
A dominating set with the condition that every vertex in has either zero or at least two neighbors in and is triple connected is a called triple connected certified domination number of a graph. The minimum cardinality among all the triple connected certified dominating sets is called the triple connected certified domination number and is denoted by . The upper bound and lower bound of for the given graphs is found and then proved the upper bound and lower bound of were equal.
Findings
We found the (TCCD)-number for the power graph of some peculiar graphs. Also, we have generalized the result for path, cycle, ladder graph, comb graph, coconut tree graph, triangular snake, alternate triangular snake, quadrilateral snake and tadpole graph. Novelty: The triple connected certified domination is a new parameter in which the certified domination holds the triple connected in induced . Keywords: Domination Number, Power Graphs, Triple Connected, Certified Domination, Triple Connected Certified Domination
Zitieren
APA
Kaviya, S., Mahadevan, G., & Sivagnanam, C. (2024). Generalizing TCCD-Number For Power Graph Of Some Graphs. Indian Journal Of Science And Technology, 17(SPI1), 115-123. https://doi.org/10.17485/ijst/v17sp1.243
Vancouver
Kaviya S, Mahadevan G, Sivagnanam C. Generalizing TCCD-Number For Power Graph Of Some Graphs. Indian Journal Of Science And Technology. 2024;17(SPI1):115-123. doi:10.17485/ijst/v17sp1.243
BibTeX
@article{Kaviya2024,
author = {Kaviya, S and Mahadevan, G and Sivagnanam, C},
title = {Generalizing TCCD-Number For Power Graph Of Some Graphs},
journal = {Indian Journal Of Science And Technology},
year = {2024},
volume = {17},
number = {SPI1},
pages = {115--123},
doi = {10.17485/ijst/v17sp1.243}
}
EUVIMED