Global outer connected domination number of a graph

MaRDI QIDQ4566250zbMATH OpenFDO

Authors Morteza Alishahi, Doost Ali Mojdeh

Publication date 14 June 2018

zbMATH Keywords

treesglobal dominationouter connected dominationglobal outer connected domination

Mathematics Subject Classification ID

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

Recommendations

• On the outer-connected domination in graphs
• scientific article; zbMATH DE number 6424505
• The outer-connected domination number of a graph
• scientific article; zbMATH DE number 5823716
• Outer-\(k\)-connected component domination in graphs

Cited in

(10)

• On the outer-connected domination in graphs
• Outer-connected 2-dominating sets of graphs
• scientific article; zbMATH DE number 6124435 (Why is no real title available?)
• Further results on global connected domination number of graphs
• scientific article; zbMATH DE number 4204392 (Why is no real title available?)
• The outer-connected domination number of Sierpiński-like graphs
• Outer independent global dominating set of trees and unicyclic graphs
• scientific article; zbMATH DE number 6424505 (Why is no real title available?)
• Global restrained Roman domination in graphs
• Outer-connected open packing sets in graphs

This page was built for publication: Global outer connected domination number of a graph

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