Edge Domination in Web Graph
DOI:
https://doi.org/10.31185/eduj.Vol2.Iss25.2743Keywords:
EdgeAbstract
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: 05C69Downloads
References
S. Arumugam and S. Velammal, “Edge domination in graphs,” Taiwanese Journal of
Mathematics, 2(2), 173–179, 1998.
A. Chaemchan , “The edge domination number of connected graphs,” Australasian Journal
of Combinatorics, 48 , 185–189, 2010.
F. Harary, “Graph Theory,” Addision-Wesley, Reading Mass., (1969).
T.W. Haynes, S.T. Hedetniemi and P.J. Slater, “Fundamentals of Domination in Graphs,”
Marcel Dekker, Inc., New York, (1997).
T.W.Haynes, S.T. Hedetniemi and P.J. Slater, “Domination in Graphs-Advanced Topics,”
Marcel Dekker, Inc., New York, (1997).
S. Mitchell and S. T. Hedetniemi, “Edge domination in trees,”Congressus Numerantium,
• 19, 489–509, 1977.
A. Nellaimurugan and A. Esakkimuthu , “Edge Domination of Splitted Graphs,
“International Journal of Modern Sciences and Engineering Technology (IJMSET), 1(1), 23 –
o 29, 2014.
S. K. Vaidya and R. M. Pandit, “Edge Domination in Some Path and Cycle Related Graphs,
• “ISRN Discrete Mathematics, 1–5, 2014.
Baogen Xu, “On edge domination numbers of graphs,” Discrete Mathematics, 294 ,311 –
o 316, 2005.
M. Yannakakis and F. Gavril, “Edge dominating sets in graphs,” SIAM Journal on
• AppliedMathematics, 38(3), 364–372, 1980.
B. Zelinka, “Edge domination in graphs of cubes,” Czechoslovak Mathematical Journal, 52
• (4), 875–879, 2002.
Downloads
Published
Issue
Section
License
Copyright (c) 2021 A. A. Omran, M. N. Al-Harere
This work is licensed under a Creative Commons Attribution 4.0 International License.
