Very cost effective bipartitions in graphs

DOI10.1016/j.akcej.2015.11.009zbMath1346.05230OpenAlexW2306121223MaRDI QIDQ322000

Stephen T. Hedetniemi, Inna Vasylieva, Teresa W. Haynes

Publication date: 14 October 2016

Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.akcej.2015.11.009

zbMATH Keywords

cost effective bipartitionvery cost effective bipartition

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph operations (line graphs, products, etc.) (05C76)

Related Items (3)

On k-cost effective domination in the corona and lexicographic product of graphs and its variant ⋮ Client-server and cost effective sets in graphs ⋮ Alliances and Related Domination Parameters

Cites Work

• Unfriendly partitions of a graph
• Algorithmic approach to the satisfactory graph partitioning problem
• The satisfactory partition problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Very cost effective bipartitions in graphs