scientific article; zbMATH DE number 866675

MaRDI QIDQ4873694zbMATH OpenFDO

Authors

Publication date 17 April 1996

zbMATH Keywords

neighborhoodNP-completetotal dominating settotal irredundanttrees

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Total irredundance in graphs
• scientific article; zbMATH DE number 4055676
• scientific article; zbMATH DE number 2188352
• On the total irredundance number of non-regular graphs
• scientific article; zbMATH DE number 140135

Cited in

(11)

• Total irredundance in graphs
• Characterization of cubic graphs \(G\) with \(\operatorname{ir}_t(G)=\operatorname{IR}_t(G)=2\)
• Distance irredundance in graphs: Complexity issues
• scientific article; zbMATH DE number 3869363 (Why is no real title available?)
• The private neighbor concept
• The total irredundance numbers on graphs
• scientific article; zbMATH DE number 4055676 (Why is no real title available?)
• The Private Neighbor Cube
• scientific article; zbMATH DE number 6180527 (Why is no real title available?)
• On perfect neighborhood and irredundant sets in trees
• Generating minimal redundant and maximal irredundant subhypergraphs

This page was built for publication:

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