Liar`s dominating set is one that identifies an intruder`s location even if one device in the neighborhood of the intruder vertex becomes faulty, that is, any one device in the neighborhood of the intruder vertex can misidentify any vertex in its closed neighborhood as the location of the intruder. The liar’s domination number is the minimum cardinality of a liar’s dominating set. In this paper, we determine the liar’s domination number for sun graphs, sun let graphs, line graphs of sun let graphs and wheel graphs.

Domination, Liar’s domination, Sun graphs, Sun let graphs, Wheel graphs

[1] A. Alimadadi, M. Chellali, and Doost Ali Mojdeh, “Liar’s dominating sets in graphs” Discrete Applied Mathematics, Vol. 211, pp. 204-210, 2016.
[2] A. Brandstӓdt, V. B. Le and J. P. Spinrad, “Graph Classes: A Survey”, PA: SIAM, Philadelphia, pp. 112, 1987.
[3] D. D Durgan, F. N. Altundag, Liar’s Domination in Graphs, Bulletin of International Mathematical Virtual Institute, Vol. 7, pp. 407-15, 2017.
[4] R. J. Faudree, M. D. Brendan, “A conjecture of Erdös and the Ramsey number r(W)”, J. Combinatorial Math., and Combinatorial Comput., Vol. 13: pp. 23-31, 1993.
[5] F. Harary and T.W. Haynes, “Double domination in graphs”, Ars Combin., Vol. 55, pp. 201-213, 2000.
[6] M. Jakovac, S. Klavazar, “Vertex-, Edge-, and Total-Colorings of Sierpinski-like Graphs”, Discrete Mathematics Vol. 309, pp. 1548-1556, 2009.
[7] S. Klavzar, “Coloring Sierpinski Graphs and Sierpinski Gasket Graphs” Taiwanese J. Math. Vol. 12, pp. 513-522, 2008.
[8] S. Klavzar and U. Milutinovic, “Graphs S(n; k) and a variant of the Tower of Hanoi problem”, Czechoslovak Math. J., Vol. 47, pp. 95-104, 1997.
[9] P. Manuel, “Location and Liar Domination of Circulant Networks”, Ars Combinatoria Waterloo then Winnipeg, Vol. 101, pp. 309-320, 2011.
[10] B.S. Panda and S. Paul, “Liar’s domination in graphs: Complexity and algorithm”, Discrete Applied Mathematics, Vol. 161, pp. 1085-1092, 2013.
[11] B. S. Panda and S. Paul, “Connected Liar’s domination in graphs: Complexity and algorithms”, Discrete Mathematics, Algorithms and Applications, Vol. 4, pp. 1-16, 2013.
[12] B. S. Panda and S. Paul, “Hardness results and approximation algorithm for total liar’s domination in graphs”, Journal of Combinatorial Optimization, Vol. 27, pp. 643-662, 2014.
[13] B. S. Panda and D. Pradhan, “A linear time algorithm to compute a minimum restrained dominating set in proper interval graphs”, Discrete Mathematics, Algorithms and Applications, Vol. 7, No. 2 ID: 1550020, 2015.
[14] B. S. Panda, S. Paul, and D. Pradhan, “Hardness Results, Approximation and Exact Algorithms for Liars Domination Problem in Graphs”, Theoretical Computer Science Vol. 573, pp. 26-42, 2015.
[15] Ponraj, Raja and Narayanan, S. Sathish, “Difference cordiality of some snake graphs”, Journal of applied mathematics and informatics, Vol. 32, pp. 377-387, 2014.
[16] I. Rajasingh, B. Rajan, A. S. Shanthi, and Albert Muthumalai, “Induced matching partition of sierpinski and honeycomb networks”, in International Conference on Informatics Engineering and Information Science, Vol. 253, pp. 390-399, 2011.
[17] M. L. Roden and P. J. Slater, “Liar’s domination in graphs”, Discrete Math., Vol. 309, pp. 5884-5890, 2008.
[18] P. J. Slater, “Liar’s Domination”, Networks, Vol. 54, pp. 70-74, 2009.
[19] A. M. Teguia, A. P. Godbole, “Sierpinski Gasket Graphs and Some of their Properties”, Australasian Journal of Combinatorics, Vol. 35, pp. 181-192, 2006.
[20] J. Vernold Vivin and M. Venkatachalam, “On b-chromatic number of Sun let graph and wheel graph families”, Journal of the Egyptian Mathematical Society, Vol. 23, pp. 215-218, 2014.