On identifying codes in the Cartesian product of a path and a complete graph.

Jason Hedetniemi

Published in: J. Comb. Optim. (2016)

Keyphrases

cartesian product
shortest path
solution path
graph theory
weighted graph
graph model
random walk
strongly connected
graph representation
structured data
directed graph
shortest path problem
graph matching
directed acyclic graph
graph partitioning
link analysis
graph theoretic
path length
graph structure