Minimum fractional dominating functions and maximum fractional packing functions

DOI10.1016/J.DISC.2008.09.049MaRDI QIDQ1025952zbMATH OpenOpenAlexFDO

Authors Robert 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)

Recommendations

• Minimum fractional totally dominating functions and maximum fractional open neighborhood packings in connected finite graphs
• Publication:3032297
• scientific article; zbMATH DE number 1750101
• Publication:3032298
• scientific article; zbMATH DE number 1124598

Cites work

• scientific article; zbMATH DE number 4130427 (Why is no real title available?)
• scientific article; zbMATH DE number 4085682 (Why is no real title available?)
• scientific article; zbMATH DE number 4089320 (Why is no real title available?)
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• scientific article; zbMATH DE number 1095172 (Why is no real title available?)
• scientific article; zbMATH DE number 1131873 (Why is no real title available?)
• scientific article; zbMATH DE number 2170404 (Why is no real title available?)
• scientific article; zbMATH DE number 2104828 (Why is no real title available?)
• scientific article; zbMATH DE number 4189776 (Why is no real title available?)
• Changing and unchanging domination: A classification
• Compact graphs and equitable partitions
• Efficient (j,k)-domination
• Fractional Roman domination
• Fractional domination in prisms
• Fractional domination of strong direct products
• Fractional inverse and inverse fractional domination.
• Generalized domination and efficient domination in graphs
• Graphs whose neighborhoods have no special cycles
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• \(p\)-norm fractional domination in graphs

Cited in

(8)

• scientific article; zbMATH DE number 4130427 (Why is no real title available?)
• scientific article; zbMATH DE number 2170404 (Why is no real title available?)
• Fractional dominating parameters
• scientific article; zbMATH DE number 1750101 (Why is no real title available?)
• Efficient domination in cubic vertex-transitive graphs
• Minimum fractional totally dominating functions and maximum fractional open neighborhood packings in connected finite graphs
• Dominating functions and total dominating functions of countable graphs
• Packing functions and dominating functions of countable graphs

This page was built for publication: Minimum fractional dominating functions and maximum fractional packing functions

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