Chromatic polynomials of signed graphs
Signed graphs are currently enjoying intense interest from the combinatorial community due to various mathematical breakthroughs that relied on results about signed graphs. We expose the discrepancies in the computation of the chromatic polynomials of signed Complete Graphs and Petersen Graphs, p...
Saved in:
| 主要作者: | |
|---|---|
| 其他作者: | |
| 格式: | Final Year Project |
| 語言: | English |
| 出版: |
Nanyang Technological University
2023
|
| 主題: | |
| 在線閱讀: | https://hdl.handle.net/10356/166474 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| 機構: | Nanyang Technological University |
| 語言: | English |
| 總結: | Signed graphs are currently enjoying intense interest from the combinatorial community
due to various mathematical breakthroughs that relied on results about signed graphs.
We expose the discrepancies in the computation of the chromatic polynomials of signed
Complete Graphs and Petersen Graphs, presented in the research paper titled “The Chromatic
Polynomials of Signed Petersen Graphs” by Beck et al.
This research paper aims to address and correct the disparities in “The Chromatic
Polynomials of Signed Petersen Graphs”. Moreover, we exhibit a SageMath code
implementation to efficiently compute the chromatic polynomials of signed graphs with the
input of adjacency matrices. We independently develop the concept of bivariate chromatic
polynomials in signed graphs in order to determine the chromatic polynomials of the subgraphs
within the signed graph. Notably, our original contribution involves the derivation of explicit
formulas to chromatic polynomials of some families of signed graphs. Furthermore, we express
the even and odd chromatic polynomials simultaneously through quasipolynomials. |
|---|