Efficient algorithm for finding final vertices in a generalized functional graph

DOI10.1007/S10958-025-07819-9MaRDI QIDQ6927663zbMATH OpenFDO

Authors O. V. Zubkov

Publication date 18 September 2025

Published in Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10958-025-07819-9

zbMATH Keywords

algorithm complexitydiscrete dynamic systemfunctional graph

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Planar graphs; geometric and topological aspects of graph theory (05C10) Combinatorial dynamics (types of periodic orbits) (37E15)

Cites work

• scientific article; zbMATH DE number 7310278 (Why is no real title available?)
• Discrete dynamical systems of the circulant type with linear functions at the vertices of the network
• The functional graph of a linear discrete dynamical system with two dominating vertices
• The number of functional digraphs

This page was built for publication: Efficient algorithm for finding final vertices in a generalized functional graph

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