The nonsplit edge domination number of a graph

zbMATH Open1201.05074MaRDI QIDQ3582091FDOQ3582091

Authors: N. D. Soner, K. M. Yogeesha, Sirous Ghobadi 

Publication date: 2 September 2010

Recommendations

• The nonsplit domination number of a graph
• Nonsplit domination edge critical graphs
• The split edge domination number of a graph
• The nonsplit domination in subdivision graph
• scientific article; zbMATH DE number 7540062

zbMATH Keywords

graphsedge domination numbernonsplit edge domination

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cited In (11)

• Cycle nonsplit domination and path nonsplit domination in graphs
• Neighborhood outer split domination in graphs
• The nonsplit domination number of fuzzy graphs
• The split edge domination number of a graph
• The nonsplit domination in subdivision graph
• Global nonsplit domination in graphs
• The non-split majority dominating set of a graph
• Nonsplit domination edge critical graphs
• Strong non split \(r\)-domination number of a graph
• The nonsplit domination number of a graph
• The forcing nonsplit domination number of a graph

This page was built for publication: The nonsplit edge domination number of a graph

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