Citations (31)
Keep up to date with the latest research on this topic with citation updates for this article.
Read on this site (2)
H. Abdollahzadeh Ahangar, M. Najimi, V. Samodivkin & Ismael G. Yero. (2017) The forcing total restrained geodetic number and the total restrained geodetic number of a graph: Realizability and complexity. AKCE International Journal of Graphs and Combinatorics 14:3, pages 242-250.
Read now
Read now
Mustafa Atici. (2003) On The Edge Geodetic Number Of A Graph. International Journal of Computer Mathematics 80:7, pages 853-861.
Read now
Read now
Articles from other publishers (29)
S. Gajavalli & A. Berin Greeni. (2023) On Geodesic Convexity in Mycielskian of Graphs. Journal of Advanced Computational Intelligence and Intelligent Informatics 27:1, pages 119-123.
Crossref
Crossref
Ahmad T. Anaqreh, Boglárka G.-Tóth & Tamás Vinkó. (2021) Algorithmic upper bounds for graph geodetic number. Central European Journal of Operations Research 30:4, pages 1221-1237.
Crossref
Crossref
Tanja Dravec. (2022) On the toll number of a graph. Discrete Applied Mathematics 321, pages 250-257.
Crossref
Crossref
Jungho Ahn, Lars Jaffke, O-joung Kwon & Paloma T. Lima. (2022) Well-partitioned chordal graphs. Discrete Mathematics 345:10, pages 112985.
Crossref
Crossref
João Vinicius C. Thompson, Loana T. Nogueira, Fábio Protti, Raquel S. F. Bravo, Mitre C. Dourado & Uéverton S. Souza. (2020) A general framework for path convexities. Journal of Combinatorial Optimization 43:5, pages 994-1009.
Crossref
Crossref
Ahmad T. Anaqreh, Boglárka G.-Tóth & Tamás Vinkó. (2021) Symbolic Regression for Approximating Graph Geodetic Number. Acta Cybernetica 25:2, pages 151-169.
Crossref
Crossref
Jungho Ahn, Lars Jaffke, O-joung Kwon & Paloma T. Lima. 2021. Algorithms and Complexity. Algorithms and Complexity
23
36
.
Dibyayan Chakraborty, Florent Foucaud, Harmender Gahlawat, Subir Kumar Ghosh & Bodhayan Roy. 2020. Algorithms and Discrete Applied Mathematics. Algorithms and Discrete Applied Mathematics
102
115
.
Diane Castonguay, Erika M.M. Coelho, Hebert Coelho & Julliano R. Nascimento. (2019) On the geodetic number of complementary prisms. Information Processing Letters 144, pages 39-42.
Crossref
Crossref
João Vinicius C. Thompson, Loana T. Nogueira, Fábio Protti, Raquel S. F. Bravo, Mitre C. Dourado & Uéverton S. Souza. 2019. Algorithmic Aspects in Information and Management. Algorithmic Aspects in Information and Management
272
283
.
Mohammad Abudayah, Omar Alomari & Hassan Ezeh. (2018) Geodetic Number of Powers of Cycles. Symmetry 10:11, pages 592.
Crossref
Crossref
Letícia R. Bueno, Lucia D. Penso, Fábio Protti, Victor R. Ramos, Dieter Rautenbach & Uéverton S. Souza. (2018) On the hardness of finding the geodetic number of a subcubic graph. Information Processing Letters 135, pages 22-27.
Crossref
Crossref
Hossein Abdollahzadeh Ahangar & Maryam Najimi. (2017) Total Restrained Geodetic Number of Graphs. Iranian Journal of Science and Technology, Transactions A: Science 41:2, pages 473-480.
Crossref
Crossref
Ignacio M. PelayoIgnacio M. Pelayo. 2013. Geodesic Convexity in Graphs. Geodesic Convexity in Graphs
91
93
.
Ignacio M. PelayoIgnacio M. Pelayo. 2013. Geodesic Convexity in Graphs. Geodesic Convexity in Graphs
81
90
.
Ignacio M. PelayoIgnacio M. Pelayo. 2013. Geodesic Convexity in Graphs. Geodesic Convexity in Graphs
69
79
.
Ignacio M. PelayoIgnacio M. Pelayo. 2013. Geodesic Convexity in Graphs. Geodesic Convexity in Graphs
57
68
.
Ignacio M. PelayoIgnacio M. Pelayo. 2013. Geodesic Convexity in Graphs. Geodesic Convexity in Graphs
39
56
.
Ignacio M. PelayoIgnacio M. Pelayo. 2013. Geodesic Convexity in Graphs. Geodesic Convexity in Graphs
9
38
.
Ignacio M. PelayoIgnacio M. Pelayo. 2013. Geodesic Convexity in Graphs. Geodesic Convexity in Graphs
1
8
.
A. P. Santhakumaran & S. V. Ullas Chandran. (2012) The 2-edge geodetic number and graph operations. Arabian Journal of Mathematics 1:2, pages 241-249.
Crossref
Crossref
Boštjan Brešar, Tadeja Kraner Šumenjak & Aleksandra Tepeh. (2011) The geodetic number of the lexicographic product of graphs. Discrete Mathematics 311:16, pages 1693-1698.
Crossref
Crossref
Boštjan Brešar, Matjaž Kovše & Aleksandra Tepeh. 2011. Structural Analysis of Complex Networks. Structural Analysis of Complex Networks
197
218
.
Mitre C. Dourado, Fábio Protti & Jayme L. Szwarcfiter. (2010) Complexity results related to monophonic convexity. Discrete Applied Mathematics 158:12, pages 1268-1274.
Crossref
Crossref
Mitre C. Dourado, Fábio Protti, Dieter Rautenbach & Jayme L. Szwarcfiter. (2010) Some remarks on the geodetic number of a graph. Discrete Mathematics 310:4, pages 832-837.
Crossref
Crossref
Carmen C. Centeno, Mitre C. Dourado & Jayme L. Szwarcfiter. (2009) On the Convexity of Paths of Length Two in Undirected Graphs. Electronic Notes in Discrete Mathematics 32, pages 11-18.
Crossref
Crossref
Linda Eroh & Ortrud R. Oellermann. (2008) Geodetic and Steiner geodetic sets in 3-Steiner distance hereditary graphs. Discrete Mathematics 308:18, pages 4212-4220.
Crossref
Crossref
Pierre Hansen & Nikolaj van Omme. (2006) On pitfalls in computing the geodetic number of a graph. Optimization Letters 1:3, pages 299-307.
Crossref
Crossref
Ortrud R. Oellermann & María Luz Puertas. (2007) Steiner intervals and Steiner geodetic numbers in distance-hereditary graphs. Discrete Mathematics 307:1, pages 88-96.
Crossref
Crossref