The outer-connected vertex edge domination number in Cartesian product graphs

DOI10.1080/09720529.2020.1748272MaRDI QIDQ5043884zbMATH OpenOpenAlexFDO

Authors A. D. Akwu, Opeyemi Oyewumi, Deborah O. A. Ajayi

Publication date 6 October 2022

Published in Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/09720529.2020.1748272

zbMATH Keywords

Cartesian product of graphsouter-connected vertex edge domination number

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)

Cites work

• Bounds on the vertex-edge domination number of a tree
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• scientific article; zbMATH DE number 1124600 (Why is no real title available?)
• scientific article; zbMATH DE number 3308993 (Why is no real title available?)
• Motion planning in Cartesian product graphs
• The independent domination numbers of strong product of two cycles
• The outer-connected domination number of a graph
• The outer-connected vertex edge domination number of a tree
• Triple connected two out degree equitable domination number
• Vertex-edge domination
• Vertex-edge domination in graphs

This page was built for publication: The outer-connected vertex edge domination number in Cartesian product graphs

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