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

DOI10.1007/S41980-023-00849-6arXiv2312.11199OpenAlexW4391390160WikidataQ129029097 ScholiaQ129029097MaRDI QIDQ6464067FDOQ6464067

Authors: Sandi Klavžar, Eva Zmazek 

Publication date: 18 December 2023

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

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

Mathematics Subject Classification ID

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

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)