Strong Upper Geodetic Number of Graphs
DOI:
https://doi.org/10.26713/cma.v12i3.1597Keywords:
Geodetic set, Strong geodetic set, Upper geodetic number.Abstract
Let \(G=(V,E)\) be a graph. A set \(S\in G\) is a strong geodetic set, if each vertex \(v\in G/S\) lies on a fixed geodetic between the pair of vertices of \(S\). A set \(S\) is called a minimal strong geodetic set, if no proper subset of \(S\) is a strong geodetic set. The maximum cardinality of a minimal strong geodetic set is the strong upper geodetic number. It is denoted by \(sg^+(G)\). In this paper, we have proved the NP-completeness of strong upper geodetic number. Some results on strong upper geodetic number and strong upper edge geodetic number of graphs were also found.
Downloads
References
Chartrand, Gary, Frank Harary, and Ping Zhang. "Geodetic sets in graphs." Discussiones Mathematicae graph theory 20.1 (2000): 129-138.
Cheston, Grant A., et al. "On the computational complexity of upper fractional domination." Discrete Applied Mathematics 27.3 (1990): 195-207.
Chellathurai, S. Robinson, and S. Padma Vijaya. "Upper Geodetic Domination Number of Graph." International Journal of Contemporary Mathematical Sciences 10.1 (2015): 23-36.
Dong, Lin, Changhong Lu, and Xiao Wang. "The upper and lower geodetic numbers of graphs." Ars Combin 91 (2009): 401-409.
Harary, Frank, Emmanuel Loukakis, and Constantine Tsouros. "The geodetic number of a graph." Mathematical and Computer Modelling 17.11 (1993): 89-95.
Iršić, Vesna. "Strong geodetic number of complete bipartite graphs and of graphs with specified diameter." Graphs and Combinatorics 34.3 (2018): 443-456.
Klavžar, Sandi, and Paul Manuel. "Strong geodetic problem in grid-like architectures." Bulletin of the Malaysian Mathematical Sciences Society 41.3 (2018): 1671-1680.
Lu, Chang-hong. "The geodetic numbers of graphs and digraphs." Science in China Series A: Mathematics 50.8 (2007): 1163-1172.
Manuel, Paul, et al. "Strong geodetic problem in networks." Discussiones Mathematicae Graph Theory 40.1 (2020): 307-321.
Manuel, Paul, et al. "Strong edge geodetic problem in networks." Open Mathematics 15.1 (2017): 1225-1235.
Manuel, Paul, et al. "Strong edge geodetic problem in networks." Open Mathematics 15.1 (2017): 1225-1235.
Santhakumaran, A. P., and J. John. "The upper edge geodetic number and the forcing edge geodetic number of a Graph." Opuscula Mathematica 29.4 (2009): 427-441.
Wang, Fu-Hsing, Yue-Li Wang, and Jou-Ming Chang. "The lower and upper forcing geodetic numbers of block–cactus graphs." European journal of operational research 175.1 (2006): 238-245.
Xavier, D. Antony, et al. "Some Results on Strong Edge Geodetic Problem in Graphs." Communications in Mathematics and Applications 11.3 (2020): 403-413.
Downloads
Published
How to Cite
Issue
Section
License
Authors who publish with this journal agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a CCAL that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work.
