Geodetic Variants of Sierpinski Triangles
Keywords:
geodetic number, strong geodetic number,, total geodetic number, hull numberAbstract
The concept of convex sets in the classical Euclidean geometry was extended to graphs and different graph convexities were studied based on the kind of path that is considered. The geodetic number of a graph is one of the extensively studied graph theoretic parameters concerning geodesic convexity in graphs. A u-v geodesic is a u-v path of length d(u,v) in G. For a non-trivial connected graph G , a set S ⊆ V (G) is called a geodetic set if every vertex not in S lies on a geodesic between two vertices from S. The cardinality of the minimum geodetic set of G is the geodetic number g(G) of G. The Sierpinski triangle , also called the Sierpinski gasket or the Sierpinski Sieve, is a fractal and attractive fixed set with the overall shape of an equilateral triangle, subdivided recursively into smaller equilateral triangles. In this paper some of the geodetic variants including hull number, monophonic hull number, geodetic number, strong geodetic number , total geodetic number ,upper geodetic number, open geodetic number and strong open geodetic number for Sierpinski triangle is investigated.
References
[1] Ahangar, H. Abdollahzadeh, and Vladimir Samodivkin. "The total geodetic number of a graph." Util. Math 100 (2016): 253-268.
[2] Buckley F., Harary F., “Distance in Graphs,” Addison-Wesley, Redwood City, CA, 1990.
[3] Chartrand, Gary, Frank Harary, and Ping Zhang. "On the geodetic number of a graph." Networks39.1 (2002): 1-6.
[4] Chartrand, Gary, et al. "Geodominationin graphs." Bulletin of the Institute of Combinatorics and its Applications 31 (2001): 51-59.
[5] Dourado, Mitre C., et al. "Some remarks on the geodetic number of a graph." Discrete Mathematics 310.4 (2010): 832-837.
[6] Everett, Martin G., and Stephen B. Seidman. "The hull number of a graph." Discrete Mathematics 57.3 (1985): 217-223.
[7] Harary, Frank, Emmanuel Loukakis, and Constantine Tsouros. "The geodetic number of a graph." Mathematical and Computer
[8] Hansberg, Adriana, Lutz Volkmann, “On the geodetic and geodetic domination numbers of a graph,” Discrete Mathematics, vol.310, no. 15, pp.2140-2146, 2010.
[9] Iršič, Vesna. "Strong geodetic number of complete bipartite graphs and of graphs with specified diameter." Graphs and Combinatorics 34.3 (2018): 443-456.
[10] Jakovac, Marko, and Sandi Klavžar. "Vertex-, edge-, and total-colorings of Sierpiński-like graphs." Discrete Mathematics309.6 (2009): 1548-1556.
[11] Jakovac, Marko. "A 2-parametric generalization of Sierpinski gasket graphs." Ars Comb. 116 (2014): 395-405.
[12] John, J., and V. Mary Gleeta. "The Forcing Monophonic Hull Number of a Graph." International Journal of Mathematics Trends and Technology 3.2 (2012): 43-46.
[13] Manuel, Paul, et al. "Strong geodetic problem in networks: computational complexity and solution for Apollonian networks." arXiv preprint arXiv:1708.03868 (2017).
[14] Pelayo, Ignacio M., Geodesic convexity in graphs, Springer, New York, 2013.Modelling 17.11 (1993): 89-95.
[15] Parisse, Daniele. "Sierpinski Graphs S (n, k)." Ars Combinatoria90 (2009): 145-160.
[16] Rodríguez-Velázquez, Juan Alberto, Erick David Rodríguez-Bazan, and Alejandro Estrada-Moreno. "On generalized Sierpiński graphs." Discussiones Mathematicae Graph Theory37.3 (2017): 547-560.
[17] Scorer, R. S., P. M. Grundy, and C. A. B. Smith. "Some binary games." The Mathematical Gazette 28.280 (1944): 96-103.
[18] A. P. Santhakumaran and T. Kumari Latha, On the open geodetic number of a graph, SCIENTIA, Series A :Mathematical Sciences, 19 (2010),131-142.
[19] Xavier, D. Antony, S. ARUL AMIRTHA RAJA"Strong Open geodetic Set in Graphs”(Communicated)
Downloads
Published
How to Cite
Issue
Section
License
This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors contributing to this journal agree to publish their articles under the Creative Commons Attribution 4.0 International License, allowing third parties to share their work (copy, distribute, transmit) and to adapt it, under the condition that the authors are given credit and that in the event of reuse or distribution, the terms of this license are made clear.
