On the efficiency index of a graph

DOI10.1007/s10878-014-9814-1zbMath1344.90060OpenAlexW2124695514MaRDI QIDQ266040

Peter J. Slater, Rommel M. Barbosa

Publication date: 13 April 2016

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-014-9814-1

zbMATH Keywords

gridscylindersdominating setstorii

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Related Items (2)

Efficient location of resources in cylindrical networks ⋮ A general lower bound for the domination number of cylindrical graphs

Cites Work

• Generalized domination and efficient domination in graphs
• A recurrence template for several parameters in series-parallel graphs
• Perfect codes in graphs
• Perfect domination in regular grid graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the efficiency index of a graph