Middle domination and 2-independence in trees

DOI10.1142/S1793830921500798zbMath1478.05106OpenAlexW3117926617MaRDI QIDQ5025158

Kijung Kim

Publication date: 1 February 2022

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

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

zbMATH Keywords

middle graph2-independence numbermiddle domination number

Mathematics Subject Classification ID

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

Related Items (1)

Perfect Roman domination in middle graphs

Cites Work

• On a conjecture of Fink and Jacobson concerning k-domination and k- dependence
• Traversability and connectivity of the middle graph of a graph
• Domination for Latin square graphs
• Mixed domination and 2-independence in trees
• Mixed Roman domination and 2-independence in trees
• Trees with equal 2-domination and 2-independence numbers
• Roman domination and 2-independence in trees
• Unnamed Item
• Unnamed Item
• Unnamed Item

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