UPM Institutional Repository

Discovering factors of graph polynomials


Citation

Yow, Kai Siong and Chen, Chuei Yee and Leong, Wah June and Ismail, Fudziah (2019) Discovering factors of graph polynomials. Discovering Mathematics, 41 (2). pp. 88-95. ISSN 2231-7023

Abstract

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 consider two graph polynomials, one for undirected graphs and one for directed graphs. We first give an overview of these two polynomials. We then discuss the factors of these polynomials as well as the information that are encapsulated by these factors.


Download File

[img] Text
Discovering factors of graph polynomials .pdf

Download (8kB)

Additional Metadata

Item Type: Article
Divisions: Faculty of Science
Institute for Mathematical Research
Publisher: Universiti Putra Malaysia
Keywords: Polynomial; Tutte polynomial; Greedoid polynomial; Directed graph; Undirected graph; Factor
Depositing User: Nurul Ainie Mokhtar
Date Deposited: 31 Mar 2021 01:01
Last Modified: 31 Mar 2021 01:01
URI: http://psasir.upm.edu.my/id/eprint/79399
Statistic Details: View Download Statistic

Actions (login required)

View Item View Item