Live briefing
Everything about Geodetic graph
Graph whose shortest paths are unique
In graph theory, a geodetic graph is an undirected graph such that there exists a unique (unweighted) shortest path between each two vertices. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Geodetic graphA 5-minute orientation
- Skim a recent paper: Denoising of Geodetic Time Series Using Spatiotemporal Graph Neural Networks: Application to Slow Slip Event ExtractionInfluential work since 2022
- Read the landmark paper: The geodetic number of a graphCited 138 times
- Go sideways: Block graphA closely related topic
- Go sideways: Glossary of graph theoryA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
The geodetic number of a graph
On the geodetic number of a graph
The forcing geodetic number of a graph
The Geodetic Number of an Oriented Graph
On The Edge Geodetic Number Of A Graph
Edge geodetic number of a graph
Monitoring edge-geodetic sets: Hardness and graph products
On the geodetic and geodetic domination numbers of a graph
🆕 Influential since 2022
Denoising of Geodetic Time Series Using Spatiotemporal Graph Neural Networks: Application to Slow Slip Event Extraction
The Upper and Forcing Connected Outer Connected Geodetic Numbers of a Graph
Geodetic convexity and kneser graphs
Monitoring Edge-Geodetic Numbers of Mycielskian Graph Classes
More on the outer connected geodetic number of a graph
📚 Books worth reading
Open Library didn't respond; try again in a moment.
🔗 Related topics
- Block graph In graph theory, a branch of combinatorial mathematics, a block graph or clique tree is a type of undirected graph in which every biconnected component…
- Glossary of graph theory Look up Appendix:Glossary of graph theory in Wiktionary, the free dictionary. This is a glossary of graph theory. Graph theory is the study of graphs,…
- Well-covered graph In graph theory, a well-covered graph is an undirected graph in which the minimal vertex covers all have the same size. Here, a vertex cover is a set of…
- Perfect graph In graph theory, a perfect graph is a graph in which the chromatic number equals the size of the maximum clique, both in the graph itself and in every…
- Chordal graph In the mathematical area of graph theory, a chordal graph is one in which all cycles of four or more vertices have a chord, which is an edge that is not…
- Hamiltonian path In the mathematical field of graph theory, a Hamiltonian path (or traceable path) is a path in an undirected or directed graph that visits each vertex…
- Cograph In graph theory, a cograph, or complement-reducible graph, or P4-free graph, is a graph that can be generated from the single-vertex graph K1 by complementation…
- Brooks' theorem In graph theory, Brooks' theorem states a relationship between the maximum degree of a graph and its chromatic number. According to the theorem, in a connected…