Factorisation of greedoid polynomials of rooted digraphs
Gordon and McMahon defined a two-variable greedoid polynomial f(G; t, z) for any greedoid G. They studied greedoid polynomials for greedoids associated with rooted graphs and rooted digraphs. They proved that greedoid polynomials of rooted digraphs have the multiplicative direct sum property. In add...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Published: |
Springer
2021
|
| _version_ | 1811137523650396160 |
|---|---|
| author | Yow, Kai Siong Morgan, Kerri Farr, Graham |
| author_facet | Yow, Kai Siong Morgan, Kerri Farr, Graham |
| author_sort | Yow, Kai Siong |
| collection | UPM |
| description | Gordon and McMahon defined a two-variable greedoid polynomial f(G; t, z) for any greedoid G. They studied greedoid polynomials for greedoids associated with rooted graphs and rooted digraphs. They proved that greedoid polynomials of rooted digraphs have the multiplicative direct sum property. In addition, these polynomials are divisible by 1 +Z under certain conditions. We compute the greedoid polynomials for all rooted digraphs up to order six. A polynomial is said to factorise if it has a non-constant factor of lower degree. We study the factorability of greedoid polynomials of rooted digraphs, particularly those that are not divisible by 1 + Z. We give some examples and an infinite family of rooted digraphs that are not direct sums but their greedoid polynomials factorise. |
| first_indexed | 2024-09-25T03:35:39Z |
| format | Article |
| id | upm.eprints-97264 |
| institution | Universiti Putra Malaysia |
| last_indexed | 2024-09-25T03:35:39Z |
| publishDate | 2021 |
| publisher | Springer |
| record_format | dspace |
| spelling | upm.eprints-972642024-08-19T02:07:11Z http://psasir.upm.edu.my/id/eprint/97264/ Factorisation of greedoid polynomials of rooted digraphs Yow, Kai Siong Morgan, Kerri Farr, Graham Gordon and McMahon defined a two-variable greedoid polynomial f(G; t, z) for any greedoid G. They studied greedoid polynomials for greedoids associated with rooted graphs and rooted digraphs. They proved that greedoid polynomials of rooted digraphs have the multiplicative direct sum property. In addition, these polynomials are divisible by 1 +Z under certain conditions. We compute the greedoid polynomials for all rooted digraphs up to order six. A polynomial is said to factorise if it has a non-constant factor of lower degree. We study the factorability of greedoid polynomials of rooted digraphs, particularly those that are not divisible by 1 + Z. We give some examples and an infinite family of rooted digraphs that are not direct sums but their greedoid polynomials factorise. Springer 2021-06-21 Article PeerReviewed Yow, Kai Siong and Morgan, Kerri and Farr, Graham (2021) Factorisation of greedoid polynomials of rooted digraphs. Graphs and Combinatorics, 37 (6). pp. 2245-2264. ISSN 0911-0119; EISSN: 1435-5914 https://link.springer.com/article/10.1007/s00373-021-02347-0 10.1007/s00373-021-02347-0 |
| spellingShingle | Yow, Kai Siong Morgan, Kerri Farr, Graham Factorisation of greedoid polynomials of rooted digraphs |
| title | Factorisation of greedoid polynomials of rooted digraphs |
| title_full | Factorisation of greedoid polynomials of rooted digraphs |
| title_fullStr | Factorisation of greedoid polynomials of rooted digraphs |
| title_full_unstemmed | Factorisation of greedoid polynomials of rooted digraphs |
| title_short | Factorisation of greedoid polynomials of rooted digraphs |
| title_sort | factorisation of greedoid polynomials of rooted digraphs |
| work_keys_str_mv | AT yowkaisiong factorisationofgreedoidpolynomialsofrooteddigraphs AT morgankerri factorisationofgreedoidpolynomialsofrooteddigraphs AT farrgraham factorisationofgreedoidpolynomialsofrooteddigraphs |