你即將離開本站

並前往https://link.springer.com/article/10.1007/s00373-007-0738-8

On the Maximum Number of Cliques in a Graph | SpringerLink

A clique is a set of pairwise adjacent vertices in a graph. ... For example, the maximum number of cliques in a planar graph with n vertices is 8(n − 2).

確定！ 回上一頁

查詢 「Clique graph」的人也找了：

  1. clique定義
    2.
  2. Clique graph
    3.
  3. clique演算法
    4.
  4. Clique NP-complete
    5.
  5. Clique number
    6.
  6. N clique
    7.
  7. Clique problem
    8.
  8. Clique cover
    9.