An O(mn2) Algorithm for Computing the Strong Geodetic Number in Outerplanar Graphs
Let G = (V (G), E(G)) be a graph and S be a subset of vertices of G. Let us denote by γ[u, v] a geodesic between u and v. Let Γ(S) = {γ[vi, vj] | vi, vj ∈ S} be a set of exactly |S|(|S|−1)/2 geodesics, one for each pair of distinct vertices in S. Let V (Γ(S)) = ∪γ[x,y]∈Γ (S) V (γ[x, y]) be the set o...
Furkejuvvon:
| Váldodahkki: | |
|---|---|
| Materiálatiipa: | Artigo |
| Giella: | Inglês |
| Almmustuhtton: |
University of Zielona Góra
2022-05-01
|
| Ráidu: | Discussiones Mathematicae Graph Theory |
| Fáttát: | |
| Liŋkkat: | https://doi.org/10.7151/dmgt.2311 |
| Fáddágilkorat: |
Eai fáddágilkorat, Lasit vuosttaš fáddágilkora!
|