ChromaticPolynomial

可用

gives the chromatic polynomial of a graph in the variable k

形式

ChromaticPolynomial[g, k]

ChromaticPolynomial[{v -> w, …}, …]

已驗證的範例ChromaticPolynomial[CycleGraph[3], k] → 2*k - 3*k^2 + k^3 ChromaticPolynomial[PetersenGraph[], 3] → 120 p[k] = ChromaticPolynomial[PetersenGraph[], k] → -704*k + 2606*k^2 - 4305*k^3 + 4275*k^4 - 2861*k^5 + 1353*k^6 - 455*k^7 + 105*k^8 - 15*k^9 + k^10

在 Qurak 上執行搜尋參考文件

主題

Computation On Graphs - Graph Polynomials
Graph Properties And Measurements - Graph Coloring
New In100 Alphabetical Listing - C
New In100 Graphs And Networks - Polynomials
Summary Of New Features In141 - Graphs & Networks
Summary Of New Features In141 - Graphs & Networks

相關

TuttePolynomial FlowPolynomial Graph BetweennessCentrality BipartiteGraphQ ButterflyGraph EulerianGraphQ GlobalClusteringCoefficient GraphAssortativity GraphDensity GraphDistanceMatrix GraphLinkEfficiency

全部 6300 個函式 · 從 MCP 用戶端使用這個