Security in Sierpiński graphs

DOI10.1016/J.DAM.2022.11.017MaRDI QIDQ2685692zbMATH OpenOpenAlexFDO

Authors Manju K. Menon, M. R. Chithra, K. S. Savitha

Publication date 22 February 2023

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2022.11.017

zbMATH Keywords

secure setssecure dominating setsSierpiński graphs

Mathematics Subject Classification ID

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

Recommendations

• On a graph's security number
• On minimum secure dominating sets of graphs
• The security number of lexicographic products
• Global secure sets of grid-like graphs
• A note on the security number of grid-like graphs

Cites work

• scientific article; zbMATH DE number 2104820 (Why is no real title available?)
• scientific article; zbMATH DE number 2188604 (Why is no real title available?)
• 1-perfect codes in Sierpiński graphs
• A survey and classification of Sierpiński-type graphs
• A textbook of graph theory
• Bounds on a graph's security number
• Connected minimum secure-dominating sets in grids
• Graphs S(n, k) and a Variant of the Tower of Hanoi Problem
• On a graph's security number
• On some metric properties of the Sierpiński graphs \(S(n,k)\)
• Secure domination of honeycomb networks
• Security in graphs

Cited in

(19)

• Global security in claw-free cubic graphs
• Secure sets and their expansion in cubic graphs
• On minimum secure dominating sets of graphs
• Security in graphs
• Integer and fractional security in graphs
• On the security of stepwise triangular systems
• Topological graph passwords based on the gracefulness of disconnected graphs with circles
• scientific article; zbMATH DE number 5139466 (Why is no real title available?)
• (F, I)-security in graphs
• The Sierpiński domination number
• A Gröbner-Shirshov algorithm for applications in internet security
• A graph theoretic method for securing key fobs
• Ultra-security in graphs
• Global secure sets of grid-like graphs
• On generalized distance secure sets in graphs
• About secure independence in graphs
• Security number of grid-like graphs
• On a graph's security number
• Percolation in the secrecy graph

This page was built for publication: Security in Sierpiński graphs

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