标题： 透明量子图 显示英文标题

标题： Transparent Quantum Graphs

摘要： 我们考虑具有透明分支点的量子图。 为了设计这样的网络，将透明边界条件的概念应用于度量图上线性薛定谔方程的顶点边界条件的推导。 这使得可以推导出简单的约束条件，这些条件在顶点处使用等效的通常基尔霍夫型边界条件代替透明边界条件。 该方法应用于量子星形图和树形图。 然而，扩展到更复杂的图结构是相当直接的。 显示英文摘要

摘要： We consider quantum graphs with transparent branching points. To design such networks, the concept of transparent boundary conditions is applied to the derivation of the vertex boundary conditions for the linear Schrodinger equation on metric graphs. This allows to derive simple constraints, which use equivalent usual Kirchhoff-type boundary conditions at the vertex to the transparent ones. The approach is applied to quantum star and tree graphs. However, extension to more complicated graph topologies is rather straight forward.