z-logo
open-access-imgOpen Access
Edge Domination in Web Graph
Author(s) -
Ahmed A. Omran,
Manal N. Al-Harere
Publication year - 2021
Publication title -
maǧallaẗ kulliyyaẗ al-tarbiyaẗ
Language(s) - English
Resource type - Journals
eISSN - 2518-5586
pISSN - 1994-4217
DOI - 10.31185/eduj.vol2.iss25.2743
Subject(s) - combinatorics , graph , graph power , computer science , cartesian product , discrete mathematics , mathematics , line graph
Let {\ \ \gamma}^e(G) be the edge domination number of a graph. A “web graph” W(s,t) is obtained from the Cartesian product of cycle graph of order s\ and path graph of order\ t. In this paper, edge domination number of the web graph is determined.Mathematical subject classification: 05C69

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