DOAJ Open Access 2023

Isolate g-eccentric domination in fuzzy graph

S. Muthupandiyan A Mohamed Ismayil

Abstrak

In a fuzzy graph G(ρ, μ), a dominating set D ⊆ P(G) is said to be g-eccentric if at least one g-eccentric vertex a of every vertex b in P − D exists in D. If the induced fuzzy sub graph < D > has at least one isolated vertex, then a g-eccentric dominating set D of G is said to be an isolate g-eccentric dominating set. The isolate g-eccentric domination number is defined as the smallest cardinality over all isolate g-eccentric dominating sets of G. This article introduces the isolate g-eccentric point set, isolate g-eccentric dominating set, and their numbers in fuzzy graphs. In some standard fuzzy graphs, bounds are found for an isolate g-eccentric domination number.

Topik & Kata Kunci

Mathematics Probabilities. Mathematical statistics

Penulis (2)

S. Muthupandiyan

A Mohamed Ismayil

Format Sitasi

APA MLA BibTeX

Muthupandiyan, S., Ismayil, A.M. (2023). Isolate g-eccentric domination in fuzzy graph. https://doi.org/10.23755/rm.v50i0.1548

Akses Cepat

PDF tidak tersedia langsung

Cek di sumber asli →

Lihat di Sumber doi.org/10.23755/rm.v50i0.1548

Informasi Jurnal

Tahun Terbit: 2023
Sumber Database: DOAJ
DOI: 10.23755/rm.v50i0.1548
Akses: Open Access ✓