Inequalities involving independence domination, f-domination, connected and total f-domination numbers

DOI10.1023/A:1022470802343zbMath1045.05073MaRDI QIDQ4814435

Sanming Zhou

Publication date: 7 September 2004

Published in: Czechoslovak Mathematical Journal (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/30563

zbMATH Keywords

domination numberindependence domination number\(f\)-domina\-tion numberconnected \(f\)-domination numbertotal \(f\)-domination number

Mathematics Subject Classification ID

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

Related Items

\(k\)-domination and \(k\)-independence in graphs: A survey ⋮ A bound on the k-domination number of a graph

Cites Work

• Unnamed Item
• Unnamed Item
• On domination and independent domination numbers of a graph
• Graph-theoretic parameters concerning domination, independence, and irredundance
• On the Number of Disjoint Edges in a Graph
• Total domination in graphs
• A new domination conception
• On $f$-domination number of a graph