Gelişmiş Arama

Basit öğe kaydını göster

dc.contributor.authorMahadevan, Gopalen_US
dc.contributor.authorPonnuchamy, T.en_US
dc.contributor.authorAvadayappan, Selvamen_US
dc.date.accessioned2021-01-19T11:58:13Z
dc.date.available2021-01-19T11:58:13Z
dc.date.issued2021
dc.identifier.citationMahadevan, G., Ponnuchamy, T. & Avadayappan, S. (2021). Triple connected eternal domination in graphs. TWMS Journal of Applied and Engineering Mathematics, 11(SI), 88-95.en_US
dc.identifier.issn2146-1147en_US
dc.identifier.issn2587-1013en_US
dc.identifier.urihttp://belgelik.isikun.edu.tr/xmlui/handle/iubelgelik/3024
dc.identifier.urihttp://jaem.isikun.edu.tr/web/index.php/archive/109-vol11-special-issue/637
dc.description.abstractThe concept of Triple connected domination number was introduced by G. Mahadevan et. al., in [10]. The concept of eternal domination in graphs was introduced by W. Goddard., et. al., in [3]. The dominating set S0(? V (G)) of the graph G is said to be an eternal dominating set, if for any sequence v1, v2, v3, . . . vk of vertices, there exists a sequence of vertices u1, u2, u3, . . . uk with ui ? Si?1 and ui equal to or adjacent to vi, such that each set Si = Si?1?{ui}?{vi} is dominating set in G. The minimum cardinality taken over the eternal dominating sets in G is called the eternal domination number of G and it is denoted by ??(G). In this paper we introduce another new concept Triple connected eternal domination in graph. The eternal dominating set S0(? V (G)) of the graph G is said to be a triple connected eternal dominating set, if each dominating set Si is triple connected. The minimum cardinality taken over the triple connected eternal dominating sets in G is called the triple connected eternal domination number of G and it is denoted by ?tc,?(G). We investigate this number for some standard graphs and obtain many results with other graph theoretical parameters.en_US
dc.description.sponsorshipThe research work was supported by DSA (Departmental special assistance) Gandhigram Rural Institute-Deemed to be university, Gandhigram under University Grants Commission- New Delhi.en_US
dc.language.isoenen_US
dc.publisherIşık University Pressen_US
dc.relation.ispartofTWMS Journal of Applied and Engineering Mathematicsen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.rightsAttribution-NonCommercial-NoDerivs 3.0 United States*
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/3.0/us/*
dc.subjectTriple connected domination numberen_US
dc.subjectEternal domination in graphsen_US
dc.subjectTriple connected eternal domination number of graphsen_US
dc.titleTriple connected eternal domination in graphsen_US
dc.typeArticleen_US
dc.description.versionPublisher's Versionen_US
dc.identifier.volume11
dc.identifier.issueSI
dc.identifier.startpage88
dc.identifier.endpage95
dc.peerreviewedYesen_US
dc.publicationstatusPublisheden_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Başka Kurum Yazarıen_US


Bu öğenin dosyaları:

Thumbnail

Bu öğe aşağıdaki koleksiyon(lar)da görünmektedir.

Basit öğe kaydını göster

info:eu-repo/semantics/openAccess
Aksi belirtilmediği sürece bu öğenin lisansı: info:eu-repo/semantics/openAccess