Strong geodetic problem on complete multipartite graphs

Matja\v{z} Konvalinka; Vesna Ir\v{s}i\v{c}

REVIEW

Strong geodetic problem on complete multipartite graphs

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1806.00302 v1 pith:SQQM2ZCD submitted 2018-06-01 math.CO

Vesna Iršič , Matjaž Konvalinka This is my paper · ORCID

classification math.CO

keywords geodeticgraphsproblemstrongcompletebipartitemultipartitevertices

verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments

read the original abstract

The strong geodetic problem is to find the smallest number of vertices such that by fixing one shortest path between each pair, all vertices of the graph are covered. In this paper we study the strong geodetic problem on complete bipartite graphs; in particular, we discuss its asymptotic behavior. Some results for complete multipartite graphs are also derived. Finally, we prove that the strong geodetic problem restricted to (general) bipartite graphs is NP-complete.

Discussion (0). Continue with ORCID to comment.

Pith tools