A Homomorphic Polynomial for Oriented Graphs

Article Type

Research Article

Publication Title

Electronic Journal of Combinatorics

Abstract

In this article, we define a function that counts the number of (onto) homomor-phisms of an oriented graph. We show that this function is always a polynomial and establish it as an extension of the notion of chromatic polynomials. We study algebraic properties of this function. In particular we show that the coefficients of these polynomials have the alternating sign property and that the polynomials associated to the independent sets have relations with the Stirling numbers of the second kind.

DOI

https://10.37236/10726

Publication Date

1-1-2023

Comments

Open Access, Gold

This document is currently not available here.

Share

COinS