2009/09/01 by Leonid Bunimovich, Bunimovich, Leonid, Benjamin Webb +1
Chemistry · Mathematics · Physics and Astronomy · #05C50 #37F99 #Combinatorics (math.CO) #Complex Network Analysis Techniques #Dynamical Systems (math.DS) #FOS: Mathematics #Graph theory and applications #Molecular spectroscopy and chirality #math.CO #math.DS #msc:05C50 #msc:37F99
paper · pdf · doi:10.48550/arxiv.0909.0053
21 pages with 8 figures. Revised version has a main result (theorem 7.2) more clearly stated
openalex publication_date 2009/09/01 · arxiv created 2009/11/12 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Let G be an arbitrary finite weighted digraph with weights in the set of complex rational functions. A general procedure is proposed which allows for the reduction of G to a smaller graph with a less complicated structure having the same spectrum as of G (up to some set known in advance). The proposed procedure has a lot of flexibility and could be used e.g. for design of networks with prescribed spectral and dynamical properties.