EUVIMEDEUVIMED entdecken
Crossref

Factorisation of Greedoid Polynomials of Rooted Digraphs

Kai Siong Yow, Kerri Morgan, Graham Farr

Graphs and Combinatorics · 2021-11 · 37 (6) · 2245-2264

DOI: 10.1007/s00373-021-02347-0 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Graphs and Combinatorics, online erschienen am 21.06.2021. Verfasst von Kai Siong Yow und 2 weiteren Autor:innen. Die Arbeit wurde bisher 6-mal zitiert (Crossref) und nennt 22 Literaturangaben.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

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\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$1 + z$$\end{document} 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\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$1 + z$$\end{document}. We give some examples and an infinite family of rooted digraphs that are not direct sums but their greedoid polynomials factorise.

Zitieren

APA

Yow, K. S., Morgan, K., & Farr, G. (2021). Factorisation of Greedoid Polynomials of Rooted Digraphs. Graphs and Combinatorics, 37(6), 2245-2264. https://doi.org/10.1007/s00373-021-02347-0

Vancouver

Yow KS, Morgan K, Farr G. Factorisation of Greedoid Polynomials of Rooted Digraphs. Graphs and Combinatorics. 2021;37(6):2245-2264. doi:10.1007/s00373-021-02347-0

BibTeX
@article{Yow2021,
  author = {Yow, Kai Siong and Morgan, Kerri and Farr, Graham},
  title = {Factorisation of Greedoid Polynomials of Rooted Digraphs},
  journal = {Graphs and Combinatorics},
  year = {2021},
  volume = {37},
  number = {6},
  pages = {2245--2264},
  doi = {10.1007/s00373-021-02347-0}
}
Kostenlos starten →