On the efficiency index of a graph

DOI10.1007/S10878-014-9814-1MaRDI QIDQ266040zbMATH OpenOpenAlexFDO

Authors Rommel Barbosa, Peter Slater

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

cylindersdominating setsgridstorii

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 4085682
• Efficient (j,k)-domination
• Efficient sets in partial k-trees
• scientific article; zbMATH DE number 637297
• k-efficient partitions of graphs

Cites work

• A recurrence template for several parameters in series-parallel graphs
• Generalized domination and efficient domination in graphs
• scientific article; zbMATH DE number 4130427 (Why is no real title available?)
• scientific article; zbMATH DE number 4057564 (Why is no real title available?)
• scientific article; zbMATH DE number 4085682 (Why is no real title available?)
• scientific article; zbMATH DE number 3675921 (Why is no real title available?)
• On efficient dominating sets in simplicial graphs
• Perfect codes in graphs
• Perfect domination in regular grid graphs

Cited in

(6)

• Efficient location of resources in cylindrical networks
• A general lower bound for the domination number of cylindrical graphs
• Defining a new graph inefficiency measure for the proportional directional distance function and introducing a new Malmquist productivity index
• Semi square stable graphs and efficient dominating sets
• Efficient sets in partial k-trees
• The efficiency of AC graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q266040)