Outer-convex domination in graphs

DOI10.1142/S1793830920500081zbMATH Open1433.05245OpenAlexW2982400791WikidataQ126860576 ScholiaQ126860576MaRDI QIDQ5216447FDOQ5216447

Authors: J. A. Dayap, Enrico L. Enriquez 

Publication date: 18 February 2020

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

Full work available at URL: https://doi.org/10.1142/s1793830920500081

Recommendations

• Outer-weakly convex domination number of graphs
• Outer-connected 2-dominating sets of graphs
• On the outer-connected domination in graphs
• The outer-connected domination number of a graph
• scientific article; zbMATH DE number 5823716

zbMATH Keywords

dominating setconvex dominating setouter-convex dominating set

Mathematics Subject Classification ID

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

Cites Work

• The outer-connected domination number of a graph
• Title not available (Why is that?)
• Towards a theory of domination in graphs
• Convexity in graphs
• Convex sets under some graph operations
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (10)

• Title not available (Why is that?)
• Outer-connected 2-dominating sets of graphs
• Convex domination in the composition and Cartesian product of graphs.
• Outer-\(k\)-connected component domination in graphs
• Outer-convex dominating set in the corona of graphs as encryption key generator
• Clique doubly connected domination in the join and lexicographic product of graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Outer-weakly convex domination number of graphs
• Inverse fair domination in the join and corona of graphs

This page was built for publication: Outer-convex domination in graphs

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