On the security number of the Cartesian product of graphs

DOI10.1016/j.dam.2021.07.030zbMath1473.05256OpenAlexW3189695347MaRDI QIDQ2231753

Yota Otachi, Marko Jakovac

Publication date: 30 September 2021

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

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

zbMATH Keywords

Cartesian productsecure set

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The security number of strong grid-like graphs
• Global security in claw-free cubic graphs
• Bounds on global secure sets in cactus trees
• Integer and fractional security in graphs
• Rooted secure sets of trees
• Global secure sets of grid-like graphs
• Complexity of secure sets
• \((F, I)\)-security in graphs
• The possible cardinalities of global secure sets in cographs
• Security number of grid-like graphs
• On a graph's security number
• Monotonicity and expansion of global secure sets
• Security in graphs
• Bounds on a graph's security number
• The security number of lexicographic products

This page was built for publication: On the security number of the Cartesian product of graphs