\((F, I)\)-security in graphs
type: Item
instance of: scholarly article
title: \((F, I)\)-security in graphs
zbMATH Open document ID: 1300.05233
author: Caleb Petrie
published in: Discrete Applied Mathematics
publication date: 2014-09-12T00:00:00Z
Mathematics Subject Classification ID: 05C69
zbMATH DE Number: 6344092
zbMATH Keywords: security
zbMATH Keywords: security number
zbMATH Keywords: attack
zbMATH Keywords: integer defense
zbMATH Keywords: ultra-security
MaRDI profile type: Publication
full work available at URL: j.dam.2013.07.005
OpenAlex ID: W1973107989
cites work: Q5422499
cites work: Hypercubes As Direct Products
cites work: Security in graphs
cites work: Bounds on a graph's security number
cites work: Maximal Flow Through a Network
cites work: A Simple Algorithm for Finding Maximal Network Flows and an Application to the Hitchcock Problem
cites work: ON PRIMITIVE GRAPHS AND OPTIMAL VERTEX ASSIGNMENTS
cites work: On Representatives of Subsets
cites work: The Marriage Problem
cites work: Q3005852
cites work: A Fast Algorithm for Powerful Alliances in Trees
cites work: Integer and fractional security in graphs
cites work: Q5443191
cites work: Small alliances in a weighted graph
cites work: Security number of grid-like graphs
cites work: Q4820818
cites work: Ultra-security in graphs
DOI: 10.1016/J.DAM.2013.07.005
description: scientific article; zbMATH DE number 6344092