Open-independent, open-locating-dominating sets

DOI10.5614/ejgta.2017.5.2.2zbMath1470.05130OpenAlexW2766693653MaRDI QIDQ5006616

Suk J. Seo, Peter J. Slater

Publication date: 16 August 2021

Published in: Electronic Journal of Graph Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.5614/ejgta.2017.5.2.2

zbMATH Keywords

distinguishing setsopen-independent setsopen-locating-dominating setsopen-independent

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (6)

Open-independent, open-locating-dominating sets in complementary prism graphs ⋮ Fault-tolerant detectors for distinguishing sets in cubic graphs ⋮ The geodetic domination number of comb product graphs ⋮ Degree equitable restrained double domination in graphs ⋮ Complexity results on open-independent, open-locating-dominating sets in complementary prism graphs ⋮ Open-independent, open-locating-dominating sets: structural aspects of some classes of graphs

Cites Work

• Open neighborhood locating-dominating in trees
• On locating--dominating sets in infinite grids
• An optimal strongly identifying code in the infinite triangular grid
• Fault-tolerant locating-dominating sets
• On strongly identifying codes
• Identifying and locating-dominating codes on chains and cycles
• An optimal locating-dominating set in the infinite triangular grid
• Nordhaus-Gaddum bounds for locating domination
• New bounds on the minimum density of an identifying code for the infinite hexagonal grid
• On graphs on \(n\) vertices having an identifying code of cardinality \(\lceil \log_{2}(n+1)\rceil\)
• Bounds for Codes Identifying Vertices in the Hexagonal Grid
• Graphical parameters for classes of tumbling block graphs
• Domination and location in acyclic graphs
• On a new class of codes for identifying vertices in graphs
• Paired-domination in graphs
• Centroidal bases in graphs
• On open neighborhood locating-dominating in graphs
• Exact Minimum Density of Codes Identifying Vertices in the Square Grid
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Open-independent, open-locating-dominating sets