Edge domination and 2-independence in trees

DOI10.1142/S179355712150159XzbMATH Open1475.05133OpenAlexW3109854254MaRDI QIDQ5013448FDOQ5013448

Mustapha Chellali, Nacéra Meddah

Publication date: 30 November 2021

Published in: Asian-European Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s179355712150159x

zbMATH Keywords

treesedge domination\(2\)-independence

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• \(k\)-domination and \(k\)-independence in graphs: A survey
• Edge Dominating Sets in Graphs
• Line domination in graphs

Cited In (4)

• On approximating (connected) 2-edge dominating set by a tree
• Title not available (Why is that?)
• Title not available (Why is that?)
• Domination edge lift critical trees

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Domination, independent domination and \(k\)-independence in trees 👍 👎
• DOMINATION AND EDGE DOMINATION IN TREES 👍 👎
• Edge-vertex domination in trees 👍 👎
• Trees with equal 2-domination and 2-independence numbers 👍 👎
• Domination number, independent domination number and 2-independence number in trees 👍 👎
• Mixed domination and 2-independence in trees 👍 👎
• Middle domination and 2-independence in trees 👍 👎

This page was built for publication: Edge domination and 2-independence in trees

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