$k$-edge geodetic graphs
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2024
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866917746169610240 |
|---|---|
| author | Guragain, Satyam Srivastava, Ravi |
| author_facet | Guragain, Satyam Srivastava, Ravi |
| contents | A graph $G$ is $k$-edge geodetic graph if every edge of $G$ lies in at least one geodesic of length $k$. We studied some basic properties of $k$-edge geodetic graphs. We investigated the $k$ edge-geodeticity of complete bipartite graph $K_{m,n}$ and provide the minimum number of largest fixed order path that can cover $K_{m,n}$. We also studied the $k$-edge geodeticity of tree and the product graphs like Cartesian product, Strong product, Corona product, and provide the bounds for the minimum number of the largest fixed order path that can cover the graph. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2408_05519 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | $k$-edge geodetic graphs Guragain, Satyam Srivastava, Ravi Combinatorics 05C12, 68Q17 A graph $G$ is $k$-edge geodetic graph if every edge of $G$ lies in at least one geodesic of length $k$. We studied some basic properties of $k$-edge geodetic graphs. We investigated the $k$ edge-geodeticity of complete bipartite graph $K_{m,n}$ and provide the minimum number of largest fixed order path that can cover $K_{m,n}$. We also studied the $k$-edge geodeticity of tree and the product graphs like Cartesian product, Strong product, Corona product, and provide the bounds for the minimum number of the largest fixed order path that can cover the graph. |
| title | $k$-edge geodetic graphs |
| topic | Combinatorics 05C12, 68Q17 |
| url | https://arxiv.org/abs/2408.05519 |