Study on a strong and weak n-connected total perfect k-dominating set in fuzzy graphs

Elavarasan, Krishnasamy; Gunasekar, Tharmalingam; Čepová, Lenka; Čep, Robert

dc.contributor.author	Elavarasan, Krishnasamy
dc.contributor.author	Gunasekar, Tharmalingam
dc.contributor.author	Čepová, Lenka
dc.contributor.author	Čep, Robert
dc.date.accessioned	2022-11-02T10:03:32Z
dc.date.available	2022-11-02T10:03:32Z
dc.date.issued	2022
dc.identifier.citation	Mathematics. 2022, vol. 10, issue 17, art. no. 3178.	cs
dc.identifier.issn	2227-7390
dc.identifier.uri	http://hdl.handle.net/10084/148849
dc.description.abstract	In this paper, the concept of a strong n-Connected Total Perfect k-connected total perfect k-dominating set and a weak n-connected total perfect k-dominating set in fuzzy graphs is introduced. In the current work, the triple-connected total perfect dominating set is modified to an n-connected total perfect k-dominating set n(ctpkD)(G) and number gamma n(ctpkD)(G). New definitions are compared with old ones. Strong and weak n-connected total perfect k-dominating set and number of fuzzy graphs are obtained. The results of those fuzzy sets are discussed with the definitions of spanning fuzzy graphs, strong and weak arcs, dominating sets, perfect dominating sets, generalization of triple-connected total perfect dominating sets of fuzzy graphs, complete, connected, bipartite, cut node, tree, bridge and some other new notions of fuzzy graphs which are analyzed with a strong and weak n(ctpkD)(G) set of fuzzy graphs. The order and size of the strong and weak n(ctpkD)(G) fuzzy set are studied. Additionally, a few related theorems and statements are analyzed.	cs
dc.language.iso	en	cs
dc.publisher	MDPI	cs
dc.relation.ispartofseries	Mathematics	cs
dc.relation.uri	https://doi.org/10.3390/math10173178	cs
dc.rights	© 2022 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license.	cs
dc.rights.uri	http://creativecommons.org/licenses/by/4.0/	cs
dc.subject	total perfect k-dominating set	cs
dc.subject	n-connected total perfect k-dominating set	cs
dc.subject	strong and weak n-connected total perfect k-dominating set and number	cs
dc.title	Study on a strong and weak n-connected total perfect k-dominating set in fuzzy graphs	cs
dc.type	article	cs
dc.identifier.doi	10.3390/math10173178
dc.rights.access	openAccess	cs
dc.type.version	publishedVersion	cs
dc.type.status	Peer-reviewed	cs
dc.description.source	Web of Science	cs
dc.description.volume	10	cs
dc.description.issue	17	cs
dc.description.firstpage	art. no. 3178	cs
dc.identifier.wos	000851751600001

Files in this item

Name:: 2227-7390-2022v10i17an3178.pdf
Size:: 1.049Mb
Format:: PDF

View/Open

This item appears in the following Collection(s)

Články z časopisů s impakt faktorem / Articles from Impact Factor Journals [6377]
Články z časopisů (od roku 2008), které v době vydání článku měly impakt faktor.
OpenAIRE [5085]
Kolekce určená pro sklízení infrastrukturou OpenAIRE; obsahuje otevřeně přístupné publikace, případně další publikace, které jsou výsledkem projektů rámcových programů Evropské komise (7. RP, H2020, Horizon Europe).
Publikační činnost Katedry obrábění, montáže a strojírenské metrologie / Publications of Department of Working and Assembly (346) [288]
Kolekce obsahuje bibliografické záznamy publikační činnosti (článků) akademických pracovníků Katedry obrábění a montáže (346) v časopisech registrovaných ve Web of Science od roku 2003 po současnost.
Publikační činnost VŠB-TUO ve Web of Science / Publications of VŠB-TUO in Web of Science [7798]
Kolekce obsahuje bibliografické záznamy článků akademických pracovníků VŠB-TUO publikovaných v časopisech indexovaných ve Web of Science od roku 1990 po současnost.

Show simple item record

© 2022 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license.

Except where otherwise noted, this item's license is described as © 2022 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license.