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...
Saved in:
Main Authors: | Yow, Kai Siong, Morgan, Kerri, Farr, Graham |
---|---|
Format: | Article |
Published: |
Springer
2021
|
Online Access: | http://psasir.upm.edu.my/id/eprint/97264/ https://link.springer.com/article/10.1007/s00373-021-02347-0 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Roots Of Polynomials
by: Khaw , Inn Seng
Published: (2007) -
Discovering factors of graph polynomials
by: Yow, Kai Siong, et al.
Published: (2019) -
Factorising formation and membership of political parties in the politics of Nigeria Fourth Republic 1999-2019
by: Lawal, Salahu Mohammed
Published: (2020) -
Dr. Lee Chia Kuang invents new software Dematel Digraph
by: Safriza, Baharuddin, et al.
Published: (2021) -
Dr. Lee Chia Kuang cipta perisian baharu Dematel Digraph
by: Safriza, Baharuddin, et al.
Published: (2021)