Discovering factors of graph polynomials
One of the most common approaches in studying any polynomial is by looking at its factors. Over the years, different graph polynomials have been defined for both undirected and directed graphs, including the Tutte polynomial, chromatic polynomial, greedoid polynomial and cover polynomial. We conside...
Main Authors: | Yow, Kai Siong, Chen, Chuei Yee, Leong, Wah June, Ismail, Fudziah |
---|---|
Format: | Article |
Language: | English |
Published: |
Universiti Putra Malaysia
2019
|
Online Access: | http://psasir.upm.edu.my/id/eprint/79399/1/Discovering%20factors%20of%20graph%20polynomials%20%20.pdf |
Similar Items
-
A class of diagonal preconditioners for limited memory BFGS method.
by: Leong, Wah June, et al.
Published: (2013) -
A class of diagonally preconditioned limited memory BFGS method for large scale unconstrained optimization
by: Leong, Wah June, et al.
Published: (2009) -
The winning percentage in congkak using a randomised strategy
by: Chuei Yee Chen, et al.
Published: (2022-10-01) -
The winning percentage in congkak using a randomised strategy
by: Chuei, Yee Chen, et al.
Published: (2022) -
Factorisation of greedoid polynomials of rooted digraphs
by: Yow, Kai Siong, et al.
Published: (2021)