Counting the average size of Markov graphs

MaRDI QIDQ5377791zbMATH OpenFDO

Authors Sergiy Kozerenko

Publication date 27 May 2019

zbMATH Keywords

maps on treesMarkov graphstopological index

Mathematics Subject Classification ID

Trees (05C05) Directed graphs (digraphs), tournaments (05C20) Enumeration in graph theory (05C30) Dynamical systems involving maps of trees and graphs (37E25) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)

Recommendations

• On the abstract properties of Markov graphs for maps on trees
• Discrete Markov graphs: loops, fixed points and maps preordering
• More on linear and metric tree maps
• The average size of independent sets of graphs
• Average size of a suffix tree for Markov sources

Cited in

(4)

• On expansive and anti-expansive tree maps
• An averaging process on hypergraphs
• Discrete Markov graphs: loops, fixed points and maps preordering
• An Optimal Lower Bound for the Size of Periodic Digraphs

This page was built for publication: Counting the average size of Markov graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5377791)