An Optimal Lower Bound for the Size of Periodic Digraphs

DOI10.47443/DML.2023.015MaRDI QIDQ5889975zbMATH OpenOpenAlexFDO

Authors Sergiy Kozerenko

Publication date 28 April 2023

Published in Discrete Mathematics Letters (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.47443/dml.2023.015

zbMATH Keywords

Markov graphperiodic digraphSharkovsky's theorem

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Combinatorial dynamics (types of periodic orbits) (37E15)

Recommendations

• An optimal algorithm for the period of a strongly connected digraph
• A lower bound for the spectral radius of a digraph
• On the lower bound of \(k\)-maximal digraphs
• The optimal diameter of \(2\)-circulant digraphs
• An (increasing) sequence of lower bounds for the spectral radius and energy of digraphs
• A lower bound for the spectral radius of graphs with fixed diameter
• A lower bound for the interval number of a graph
• Asymptotically optimal (, D', s)-digraphs
• A Lower Bound on Cycle-Finding in Sparse Digraphs
• A Lower Bound on Cycle-Finding in Sparse Digraphs

Cites work

• A graph-theoretic proof of Sharkovsky's theorem on the periodic points of continuous functions
• Counting the average size of Markov graphs
• scientific article; zbMATH DE number 3197700 (Why is no real title available?)
• Markov graphs of one-dimensional dynamical systems and their discrete analogues
• Number of digraphs of periodic points of a continuous mapping of an interval into itself
• Periodic digraphs and their properties
• Periodic Points of Continuous Functions
• Vertex maps for trees: algebra and periods of periodic orbits

Cited in

(1)

• Asymptotically optimal (, D', s)-digraphs

This page was built for publication: An Optimal Lower Bound for the Size of Periodic Digraphs

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