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

Ayhan khalil | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

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

Author(s) -

Ayhan khalil

Publication year - 1999

Publication title -

mağallaẗ al-tarbiyaẗ wa-al-ʻilm

Language(s) - English

Resource type - Journals

eISSN - 2664-2530

pISSN - 1812-125X

DOI - 10.33899/edusj.1999.58719

Subject(s) - dominating set , combinatorics , domination analysis , discrete mathematics , vertex (graph theory) , mathematics , graph , computer science

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:

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research