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

DOI10.1080/09720529.2020.1748272zbMath1496.05120OpenAlexW3029667504MaRDI QIDQ5043884

Opeyemi Oyewumi, Abolape D. Akwu, Deborah Olayide 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

• Motion planning in Cartesian product graphs
• Bounds on the vertex-edge domination number of a tree
• The independent domination numbers of strong product of two cycles
• Triple connected two out degree equitable domination number
• Vertex-edge domination in graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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