EUVIMEDEUVIMED entdecken
Crossref

Edge Domination and Secure Edge Domination in Mycielski Graph of Trees

Nayana P G, Chithra M R

Ars Combinatoria · 2024

DOI: 10.61091/ars-160-16 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Ars Combinatoria, 2024. Verfasst von Nayana P G und 1 weiteren Autor:innen.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

The secure edge dominating set of a graph G is an edge dominating set F with the property that for each edge e ∈ E − F , there exists f ∈ F adjacent to e such that ( F − { f } ) ∪ { e } is an edge dominating set. In this paper, we obtained upper bounds for edge domination and secure edge domination number for Mycielski of a tree.

Zitieren

APA

G, N. P., & R, C. M. (2024). Edge Domination and Secure Edge Domination in Mycielski Graph of Trees. Ars Combinatoria. https://doi.org/10.61091/ars-160-16

Vancouver

G NP, R CM. Edge Domination and Secure Edge Domination in Mycielski Graph of Trees. Ars Combinatoria. 2024. doi:10.61091/ars-160-16

BibTeX
@article{G2024,
  author = {G, Nayana P and R, Chithra M},
  title = {Edge Domination and Secure Edge Domination in Mycielski Graph of Trees},
  journal = {Ars Combinatoria},
  year = {2024},
  doi = {10.61091/ars-160-16}
}
Kostenlos starten →