Photo from archive.org
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… Click to show full 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 consists of unbranched subgraphs E. We find several situations where something can be said about the location of the zeros of $$p_\mathcal{F}$$pF.
Keywords:
graph counting;
oriented graphs;
counting polynomials;
polynomials oriented
Journal Title: Journal of Statistical Physics
Year Published: 2018
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!
Journal Title: Journal of Statistical Physics
Year Published: 2018
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!