Two graphs are isomorphic if there is a correspondence between their vertex sets that preserves adjacency.

 
  • 如果在两个图之间存在一个保持邻接性的1-1对应,则这两个图是同构的。
今日热词
目录 附录 查词历史