Locating-dominating partitions for some classes of graphs

DOI10.1016/J.DISC.2025.114886MaRDI QIDQ6883635zbMATH OpenFDO

Authors Florent Foucaud, Paras Vinubhai Maniya, Kaustav K. Paul, D. Pradhan

Publication date 16 December 2025

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DISC.2025.114886

zbMATH Keywords

distance-hereditary graphsdomination numberLD-partitionlocation-domination numbermaximal outerplanar graphssplit graphs

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12) Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites work

• A combinatorial theorem in plane geometry
• A note on locating-dominating sets in twin-free graphs
• Dominating sets inducing large components in maximal outerplanar graphs
• Efficient algorithms for Roman domination on some classes of graphs
• Exploring algorithmic solutions for the independent Roman domination problem in graphs
• scientific article; zbMATH DE number 4070954 (Why is no real title available?)
• Locating-dominating sets and identifying codes in graphs of girth at least 5
• Locating-dominating sets in twin-free graphs
• Locating-domination and identification
• Location-domination and matching in cubic graphs
• Location-domination in line graphs
• Metric dimension of maximal outerplanar graphs
• On the secure domination numbers of maximal outerplanar graphs
• On three domination-based identification problems in block graphs
• The difference between the metric dimension and the determining number of a graph
• Total domination in maximal outerplanar graphs. II.
• Unique response Roman domination: complexity and algorithms

Cited in

(1)

• A note on partitioning the vertex set of a graph into a dominating set and a locating dominating set

This page was built for publication: Locating-dominating partitions for some classes of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6883635)