Strong Edge Geodetic Problem on Complete Multipartite Graphs and some Extremal Graphs for the Problem

DOI10.1007/S41980-023-00849-6MaRDI QIDQ6464067zbMATH OpenOpenAlexWikidataFDO

Authors Sandi Klavžar, Eva Zmazek

Publication date 18 December 2023

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/s41980-023-00849-6

Mathematics Subject Classification ID

Distance in graphs (05C12) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Strong geodetic problem on complete multipartite graphs
• Strong edge geodetic problem on grids
• Strong geodetic number of complete bipartite graphs and of graphs with specified diameter
• Strong geodetic problem on Cartesian products of graphs
• Strong geodetic number of complete bipartite graphs, crown graphs and hypercubes

This page was built for publication: Strong Edge Geodetic Problem on Complete Multipartite Graphs and some Extremal Graphs for the Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6464067)