Independent locating-dominating sets in some graphs constructed from cycles

Página do item simplificado
dc.creatorLemos, Dayllon Vinícius Xavier
dc.creatorSantana, Marcia Rodrigues Cappelle
dc.creatorCoelho, Erika Morais Martins
dc.creatorFoulds, Leslie Richard
dc.creatorLongo, Humberto José
dc.date.accessioned2026-02-26T16:16:21Z
dc.date.available2026-02-26T16:16:21Z
dc.date.issued2025
dc.description.abstractWe investigate independent locating-dominating (ILD) sets in some graph classes constructed from cycles: power of cycles, Möbius ladders, circular ladders, Jahangir graphs, helm graphs and sunflower graphs. These sets are important in applications such as fault detection and monitoring in networks. We demonstrate that power graphs C_n^k with k \geqslant 2 do not admit ILD sets. For the remaining graph families, we establish exact values for the ILD number and present constructive methods for obtaining minimum ILD sets.
dc.identifier.citationXAVIER, Dayllon Vinícius et al. Independent locating-dominating sets in some graphs constructed from cycles. Matemática Contemporânea, Rio de Janeiro, 2025. DOI: 10.1007/s44425-025-00023-6. Disponível em: https://link.springer.com/article/10.1007/s44425-025-00023-6. Acesso em: 12 fev. 2026.
dc.identifier.doi10.1007/s44425-025-00023-6
dc.identifier.issn0103-9059
dc.identifier.issne- 2317-6636
dc.identifier.urihttps://link.springer.com/article/10.1007/s44425-025-00023-6
dc.language.isoeng
dc.publisher.countryBrasil
dc.publisher.departmentInstituto de Informática - INF (RMG)
dc.rightsAcesso Restrito
dc.subjectILD
dc.subjectLocating-dominating
dc.subjectIndependent
dc.subjectCycles
dc.titleIndependent locating-dominating sets in some graphs constructed from cycles
dc.typeArtigo

Arquivos

Licença do Pacote

Agora exibindo 1 - 1 de 1
Imagem de Miniatura
Nome:
license.txt
Tamanho:
1.71 KB
Formato:
Item-specific license agreed upon to submission
Descrição:
Baixar

Coleções

INF - Artigos publicados em periódicos