\((F, I)\)-security in graphs
From MaRDI portal
Publication:741750
DOI10.1016/j.dam.2013.07.005zbMath1300.05233OpenAlexW1973107989MaRDI QIDQ741750
Publication date: 12 September 2014
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2013.07.005
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Integer and fractional security in graphs
- Small alliances in a weighted graph
- Security number of grid-like graphs
- Security in graphs
- Bounds on a graph's security number
- A Fast Algorithm for Powerful Alliances in Trees
- Maximal Flow Through a Network
- A Simple Algorithm for Finding Maximal Network Flows and an Application to the Hitchcock Problem
- On Representatives of Subsets
- Hypercubes As Direct Products
- ON PRIMITIVE GRAPHS AND OPTIMAL VERTEX ASSIGNMENTS
- The Marriage Problem
This page was built for publication: \((F, I)\)-security in graphs
