Security in Sierpiński graphs
From MaRDI portal
Publication:2685692
DOI10.1016/J.DAM.2022.11.017OpenAlexW4311711422MaRDI QIDQ2685692FDOQ2685692
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
Recommendations
Cites Work
- On some metric properties of the Sierpiński graphs \(S(n,k)\)
- Graphs S(n, k) and a Variant of the Tower of Hanoi Problem
- 1-perfect codes in Sierpiński graphs
- A textbook of graph theory
- Title not available (Why is that?)
- Title not available (Why is that?)
- On a graph's security number
- Security in graphs
- Bounds on a graph's security number
- A survey and classification of Sierpiński-type graphs
- Connected minimum secure-dominating sets in grids
- Secure domination of honeycomb networks
Cited In (19)
- On minimum secure dominating sets of graphs
- Security in graphs
- Global security in claw-free cubic graphs
- Secure sets and their expansion in cubic 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
- Title not available (Why is that?)
- \((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
- On generalized distance secure sets in graphs
- Global secure sets of grid-like 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)
