On generalized distance secure sets in graphs

DOI10.17777/PJMS2024.27.4.615MaRDI QIDQ6639245zbMATH OpenFDO

Authors Kalachar Karthik, Chandru Hegde

Publication date 15 November 2024

Published in Proceedings of the Jangjeon Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.17777/PJMS2024.27.4.615

zbMATH Keywords

distance secure setssecure setssecurity numberultra secure sets

Mathematics Subject Classification ID

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) Graph operations (line graphs, products, etc.) (05C76)

Recommendations

• Ultra-security in graphs
• On a graph's security number
• Security in graphs
• Security in Sierpiński graphs
• Integer and fractional security in graphs

This page was built for publication: On generalized distance secure sets in graphs

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