scientific article; zbMATH DE number 975353

MaRDI QIDQ5284022zbMATH OpenFDO

Authors Eleanor O'M. Hare, David P. Jacobs, Aniket Majumdar, Gerd H. Fricke

Publication date 4 February 1997

zbMATH Keywords

total dominating settotal domination numberlinear-time algorithmbalanced matricesfractional total domination

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Extremal problems in graph theory (05C35)

Recommendations

• On the computational complexity of upper total domination
• On the computational complexity of upper fractional domination
• On total dominating sets in graphs
• On the Algorithmic Complexity of Total Domination
• scientific article; zbMATH DE number 1109413

Cited in

(12)

• Vector representation of graph domination
• CONVEXITY OF MINIMAL DOMINATING FUNCTIONS OF TREES: A SURVEY
• Bibliography on domination in graphs and some basic definitions of domination parameters
• On total \(f\)-domination: polyhedral and algorithmic results
• On the computational complexity of upper total domination
• Universal maximal packing functions of graphs
• On the computational complexity of upper fractional domination
• Fractional domination of strong direct products
• Signed total domination in graphs.
• Fractional dominating parameters
• The sequence of upper and lower domination, independence and irredundance numbers of a graph
• Dominating functions and total dominating functions of countable graphs

This page was built for publication:

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