According to Mathworld there is an undocumented function
GraphComputation`GraphProduct[G1, G2, "Cartesian"]
To compute the cartesian graph product.
Now in line with the example shown:
I would expect
GraphComputation`GraphProduct[PathGraph[Range[2]], PathGraph[Range[3]], "Cartesian"]
To product the ladder graph shown on the right. Yet, the end result seems to be which doesn't even have the right number of nodes.
Is the function just unfinished (and presumably the reason for its undocumented nature), or is there some way to coax it into providing the correct answer?
VertexLabels -> "Name"
andImagePadding -> 20
. $\endgroup$GraphLayout -> {"GridEmbedding", "Dimension" -> {2, 3}}
. $\endgroup$