Domination Number in Sierpriński 4-Cycle
Graph

Mohit James

doi:https://doi.org/10.14445/22315373/IJMTT-V52P579

International Journal of Mathematics Trends and Technology

Research Article | Open Access | Download PDF

Volume 52 | Number 8 | Year 2017 | Article Id. IJMTT-V52P579 | DOI : https://doi.org/10.14445/22315373/IJMTT-V52P579

Domination Number in Sierpriński 4-Cycle Graph

Mohit James

Abstract

In this paper I found the edge domination number and vertex domination number of Sierpriński 4- cycle graph

Keywords

Domination Number, Sierpriński Graph, Cycle Graph

References

[1] Hinz, A. M., Schief, A., “The average distance on the Sierpriński gasket”,Probab. Theory Related Fields 87, 129-138, 1990.
[2] S. Klavžar and U. Milutinovic, Graphs “S(n; k) and a variant of the Tower of Hanoï problem”, Czechoslovak Math. J. 47(122) 95-104, 1997.
[3] Alberto M. Teguia and Anant P. Godbole, “Sierprinski Gasket Graphs and Some of their properties”, www.arxiv:math/0509259vl, 1-15, 2005.
[4] Michael D. Plummer, “Some recent result on Domination in Graphs” Journal of Graph Theory, vol. 26, 457-474, 2006.
[5] FuXulianga, Yang Yuanshenga, Jiang Baoqia“Dominating set Generalized Peterson graph”, Science direct discrete mathematics, vol.309, 2445-2451.[2009].
[6] Sylvain Gravier,;MatjažKovše, AlineParreau“Generalized Sierpinski graphs”, 2011.
[7] Hinz, A. M., Klav_zar, S., Milutinovi_c, U., Petr, C., “The Tower of HanoiMyths and Maths”, Birkh•auser/Springer, Basel, 2013.
[8] A. Vijayan,J.SherinaBeul, “Edge-Vertex Dominating Sets and Edge- Vertex Domination Polynomial of cycles”, Open Journal of Discrete Mathematics, vol. 5, 74-8 2014.

Citation :

Mohit James, "Domination Number in Sierpriński 4-Cycle Graph," International Journal of Mathematics Trends and Technology (IJMTT), vol. 52, no. 8, pp. 562-569, 2017. Crossref, https://doi.org/10.14445/22315373/IJMTT-V52P579