Outer-convex dominating set in the corona of graphs as encryption key generator

DOI10.1155/2020/8316454zbMath1454.94097OpenAlexW3096969609WikidataQ122259160 ScholiaQ122259160MaRDI QIDQ2221650

R. Anoos, J. A. Dayap, Saeed Kosari, Zehui Shao, Seyyed Mahmoud Sheikholeslami

Publication date: 2 February 2021

Published in: Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2020/8316454

Mathematics Subject Classification ID

Applications of graph theory (05C90) Cryptography (94A60) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (1)

Unnamed Item

Cites Work

• Communication Theory of Secrecy Systems*
• Outer-weakly convex domination number of graphs
• Outer-convex domination in graphs
• The convex domination subdivision number of a graph

This page was built for publication: Outer-convex dominating set in the corona of graphs as encryption key generator