Graph-Counting Polynomials for Oriented Graphs
Sign Up to like & getrecommendations! Published in 2018 at "Journal of Statistical Physics"
DOI: 10.1007/s10955-018-2137-3
Abstract: If $$\mathcal{F}$$F is a set of subgraphs F of a finite graph E we define a graph-counting polynomial $$p_\mathcal{F}(z)=\sum _{F\in \mathcal{F}}z^{|F|}$$pF(z)=∑F∈Fz|F| In the present note we consider oriented graphs and discuss some cases where $$\mathcal{F}$$F… read more here.
Keywords: graph counting; oriented graphs; counting polynomials; polynomials oriented ... See more keywords