Relating the annihilation number and the 2-domination number of a tree

DOI10.1016/j.disc.2013.11.020zbMath1281.05104OpenAlexW1973107135MaRDI QIDQ394342

Douglas F. Rall, Anders Yeo, Michael A. Henning, Wyatt J. Desormeaux

Publication date: 27 January 2014

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2013.11.020

zbMATH Keywords

2-domination2-domination numberannihilation number

Mathematics Subject Classification ID

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

Related Items (7)

A note on the annihilation number and 2-domination number of a tree ⋮ Bounding the locating-total domination number of a tree in terms of its annihilation number ⋮ Relating the total domination number and the annihilation number for quasi-trees and some composite graphs ⋮ The annihilation number does not bound the 2-domination number from the above ⋮ Relating the annihilation number and the 2-domination number of block graphs ⋮ Relating the total domination number and the annihilation number of cactus graphs and block graphs ⋮ Independent \((k + 1)\)-domination in \(k\)-trees

Uses Software

• Graffiti.pc

Cites Work

• Graphs with equal independence and annihilation numbers
• \(k\)-domination and \(k\)-independence in graphs: A survey
• A note on the k-domination number of a graph
• Independence and the Havel-Hakimi residue
• Bounds on the \(k\)-domination number of a graph
• Independence andk-domination in graphs
• A new domination conception
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Relating the annihilation number and the 2-domination number of a tree