(k,r)-Irredundant sets in graphs

DOI10.17654/DM017020113zbMATH Open1357.05113MaRDI QIDQ2968232FDOQ2968232

Authors:

Publication date: 10 March 2017

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

Full work available at URL: http://www.pphmj.com/abstract/9784.htm

Recommendations

• An alternative definition of the \(k\)-irredundance
• scientific article; zbMATH DE number 140135
• Irredundance graphs
• Irredundant ramsey numbers for graphs
• scientific article; zbMATH DE number 3977049

zbMATH Keywords

\((k,r)\)-dominating sets\((k,r)\)-irredundant sets

Mathematics Subject Classification ID

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

Cited In (3)

• An alternative definition of the \(k\)-irredundance
• Irredundance graphs
• Irreversible 2-conversion set in graphs of bounded degree

This page was built for publication: \((k,r)\)-Irredundant sets in graphs

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