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:
Main Author: | Utomo, Charissa Irene |
---|---|
Other Authors: | Gary Royden Watson Greaves |
Format: | Final Year Project |
Language: | English |
Published: |
Nanyang Technological University
2023
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/166474 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
On chromatic polynomials of regular graphs and modified wheels
by: Aves, Lovelina A.
Published: (1994) -
On the game chromatic number of Cartesian product of graphs
by: Encinas, Sarah Jane K., et al.
Published: (2010) -
Eigenvalues of the perfect matching derangement graph
by: Koh, Samuel Zhi Kang
Published: (2023) -
Toxicity prediction via algebraic graph-assisted bidirectional transformers
by: Ooi, Yen Sun
Published: (2023) -
Graphs with three eigenvalues
by: Xiong, Zhiyuan
Published: (2019)