Ultra-security in graphs

MaRDI QIDQ2869406zbMATH OpenFDO

Authors Caleb Petrie

Publication date 3 January 2014

Published in Congressus Numerantium (Search for Journal in Brave)

Mathematics Subject Classification ID

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

Recommendations

• On a graph's security number
• Security in graphs
• (F, I)-security in graphs
• Security in Sierpiński graphs
• Integer and fractional security in graphs

Cited in

(9)

• A graph theoretic method for securing key fobs
• Security in graphs
• Global security in claw-free cubic graphs
• Integer and fractional security in graphs
• scientific article; zbMATH DE number 1788241 (Why is no real title available?)
• About secure independence in graphs
• scientific article; zbMATH DE number 2188604 (Why is no real title available?)
• On generalized distance secure sets in graphs
• (F, I)-security in graphs

This page was built for publication: Ultra-security in graphs

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