A direct inductive proof of a conjecture due to E. Sampathkumar and L. Pushpa Latha on the weak domination number of a tree

zbMATH Open0913.05063MaRDI QIDQ1273282FDOQ1273282

Authors: Purnima Gupta, B. D. Acharya 

Publication date: 8 June 1999

Published in: National Academy Science Letters (Search for Journal in Brave)

Recommendations

• scientific article; zbMATH DE number 5174847
• On weak and restrained domination in trees
• Some bounds on the \(p\)-domination number in trees
• A note on the p-domination number of trees
• A new lower bound for the independent domination number of a tree
• On \([1,2]\)-domination in trees
• An alternative proof of a lower bound on the 2-domination number of a tree
• Some remarks on lower bounds on the \(p\)-domination number in trees
• Domination parameters and Gallai-type theorems for directed trees.
• A lower bound on the total outer-independent domination number of a tree

zbMATH Keywords

treeindependence numberindependent domination numberweak domination number

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35)

Cited In (2)

• Characterizing minimal point set dominating sets
• Weak edge-degree domination in hypergraphs

This page was built for publication: A direct inductive proof of a conjecture due to E. Sampathkumar and L. Pushpa Latha on the weak domination number of a tree

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