The security number of lexicographic products

DOI10.2989/16073606.2017.1393705zbMath1395.05126OpenAlexW2767448406MaRDI QIDQ5375880

Iztok Peterin, Marko Jakovac, Tanja Gologranc

Publication date: 17 September 2018

Published in: Quaestiones Mathematicae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2989/16073606.2017.1393705

zbMATH Keywords

lexicographic product of graphssecure setsecurity number

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)

Related Items (1)

On the security number of the Cartesian product of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The security number of strong grid-like graphs
• Bounds on global secure sets in cactus trees
• Global secure sets of grid-like 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

This page was built for publication: The security number of lexicographic products