Circular Geodetic Number of Certain Graphs
Keywords:
Circular geodetic, Complete bipartite, Hexagonal mesh network, ApollonianAbstract
A new variant geodetic problem, circular geodetic is defined as follows: Let S={x_1,x_2,...,x_k,x_(k+1)=x_1} be a geodetic set of G. Then S is said to be a circular geodetic set of G, there exists an index i, 1≤i≤k, such that I[x_i,x_(i+1)] contains atleast a vertex v other than x_i and x_(i+1), also I[S]=V(G). The minimum number of vertices needed to form a circular geodetic set is called circular geodetic number of G and it is denoted by g_cir (G).
References
[1] Jurczyk, M., Siegel, H. J., Stunkel, C. B., Interconnection Networks for Parallel Computers, Wiley Encyclopedia of Computer Science and Engineering, 2008.
[2] G.Chartrand, F. Harary, H. C. Swart and P. Zhang, Geodomination in Graphs, Bulletin of the ICA, 31(2001), 51-59.
[3] Pelayo, Ignacio M. Geodesic convexity in graphs. New York: Springer, 2013.
[4] G. Sabidussi, Graphs with given group and given graph-theoretical properties, Can. J. Math. 9 (1957) 515-525.
[5] Pelayo, Ignacio M. Geodesic convexity in graphs. New York: Springer, 2013.
[6] Hansberg, Adriana, and Lutz Volkmann. "On the geodetic and geodetic domination numbers of a graph." Discrete Mathematics 310.15 (2010): 2140-2146.
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.
