Minimum fractional dominating functions and maximum fractional packing functions

DOI10.1016/j.disc.2008.09.049zbMath1215.05092OpenAlexW2057376740MaRDI QIDQ1025952

Robert R. Rubalcaba, Matt Walsh

Publication date: 23 June 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2008.09.049

zbMATH Keywords

complementary slacknessfractional dominationfractional isomorphism

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items

Dominating functions and total dominating functions of countable graphs ⋮ Efficient domination in cubic vertex-transitive graphs ⋮ Packing functions and dominating functions of countable graphs ⋮ Fractional Dominating Parameters

Cites Work

• Compact graphs and equitable partitions
• Graphs whose neighborhoods have no special cycles
• Generalized domination and efficient domination in graphs
• Fractional domination of strong direct products
• Changing and unchanging domination: A classification
• \(p\)-norm fractional domination in graphs
• Efficient (j,k)-domination
• Fractional domination in prisms
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item