On equality in an upper bound for the equivalence domination number

DOI10.2989/16073606.2014.981691zbMATH Open1426.05123OpenAlexW2321747483MaRDI QIDQ2968651

M. Sundarakannan, S. Arumugam

Publication date: 20 March 2017

Published in: Quaestiones Mathematicae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2989/16073606.2014.981691

zbMATH Keywords

independent setdominating setequivalence setequivalence domination number

Mathematics Subject Classification ID

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

Related Items (1)

Equalityof Secure Domination and Inverse Secure Domination Numbers

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Equality in a bound that relates the size and the restrained domination number of a graph 👍 👎
• On equality in an upper bound for the domination number with respect to nondegenerate properties 👍 👎
• A note on the domination equalities 👍 👎
• On equality in an upper bound for the restrained and total domination numbers of a graph 👍 👎
• Equivalence domination in graphs 👍 👎
• On equality in an upper bound for domination parameters of graphs 👍 👎

This page was built for publication: On equality in an upper bound for the equivalence domination number

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