REVIEW
Strong geodetic number of complete bipartite graphs, crown graphs and hypercubes
Not yet reviewed by Pith; the record is open.
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
Signed reviews
abstract
The strong geodetic number, $\text{sg}(G),$ of a graph $G$ is the smallest number of vertices such that by fixing one geodesic between each pair of selected vertices, all vertices of the graph are covered. In this paper, the study of the strong geodetic number of complete bipartite graphs is continued. The formula for $\text{sg}(K_{n,m})$ is given, as well as a formula for the crown graphs $S_n^0$. Bounds on $\text{sg}(Q_n)$ are also discussed.
Discussion (0). Continue with ORCID to comment.