Fractional Dominating Parameters

DOI10.1007/978-3-030-51117-3_10zbMath1479.05266MaRDI QIDQ3384613

Wayne Goddard, Michael A. Henning

Publication date: 15 December 2021

Published in: Topics in Domination in Graphs (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-51117-3_10

zbMATH Keywords

fractional domination; integer domination; real domination

Mathematics Subject Classification ID

05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)

Cites Work

• On the computational complexity of upper fractional domination
• A new polynomial-time algorithm for linear programming
• Domination, independent domination, and duality in strongly chordal graphs
• On integer domination in graphs and Vizing-like problems
• Minimum fractional dominating functions and maximum fractional packing functions
• Generalized domination and efficient domination in graphs
• Real and integer domination in graphs
• Fractional domination of strong direct products
• Classes of graphs for which upper fractional domination equals independence, upper domination, and upper irredundance
• The bondage and reinforcement numbers of \(\gamma_ f\) for some graphs
• An inequality related to Vizing's conjecture
• Fractional dominations and fractional total dominations of graph complements
• Transversal numbers of uniform hypergraphs
• Graph products and integer domination
• Towards a theory of domination in graphs
• Domination, Fractional Domination, 2-Packing, and Graph Products
• Approximations of the domination number of a graph
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item