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

DOI10.1023/A:1022470802343zbMATH Open1045.05073MaRDI QIDQ4814435FDOQ4814435

Authors: 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

Recommendations

• On $f$-domination number of a graph
• Invariants concerning \(f\)-domination in graphs
• Upper bounds for \(f\)-domination number of graphs
• Fractional independence and fractional domination chain in graphs
• scientific article; zbMATH DE number 1161346

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)

Cites Work

• Total domination in graphs
• On domination and independent domination numbers of a graph
• Graph-theoretic parameters concerning domination, independence, and irredundance
• A new domination conception
• Title not available (Why is that?)
• On $f$-domination number of a graph
• Title not available (Why is that?)
• On the Number of Disjoint Edges in a Graph

Cited In (4)

• A bound on the \(k\)-domination number of a graph.
• \(k\)-domination and \(k\)-independence in graphs: A survey
• On a conjecture of Fink and Jacobson concerning k-domination and k- dependence
• Upper bounds for \(f\)-domination number of graphs

This page was built for publication: Inequalities involving independence domination, f-domination, connected and total f-domination numbers

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