Total irredundance in graphs

DOI10.1016/S0012-365X(00)00459-3zbMath1007.05074OpenAlexW1992868998MaRDI QIDQ1849917

Michael A. Henning, Debra J. Knisley, Stephen T. Hedetniemi, Teresa W. Haynes, Odile Favaron

Publication date: 2 December 2002

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(00)00459-3

zbMATH Keywords

total irredundance

Mathematics Subject Classification ID

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

Related Items (5)

Breaking the \(2^{n}\)-barrier for irredundance: two lines of attack ⋮ Formalization of the Domination Chain with Weighted Parameters (Short Paper) ⋮ Characterization of cubic graphs \(G\) with \(\operatorname{ir}_t(G)=\operatorname{IR}_t(G)=2\) ⋮ The total irredundance numbers on graphs ⋮ The Private Neighbor Concept

This page was built for publication: Total irredundance in graphs