Geodetic numbers of tensor product and lexicographic product of graphs
A shortest [Formula: see text]-[Formula: see text] path between two vertices u and v of a graph G is a [Formula: see text]-[Formula: see text] geodesic of G. Let I[u, v] denote the set of all internal vertices lying on some [Formula: see text]-[Formula: see text] geodesic of G. For a nonempty subset...
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Taylor & Francis Group
2025-01-01
|
| Series: | AKCE International Journal of Graphs and Combinatorics |
| Subjects: | |
| Online Access: | https://www.tandfonline.com/doi/10.1080/09728600.2024.2422535 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|