English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Tools annual

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

A set is dominating set of a graph G, if every vertex in V-S is adjacent to at least one vertex in S. The domination number denoted by is defined to be the minimum cardinality of dominating set in G. We investigate the domination numbers of Helm graph, web graph and Levi graph. Also we testing our theoretical results in computer by introduce a matlab procedure to calculate the domination numbers , dominating set S and draw this graphs that illustrated the vertices of domination this graphs. It is proved that:

Determination and Testing the Domination Numbers of Helm Graph, Web Graph and Levi Graph Using MATLAB