适定图的生成树上的算法化释放
Algorithmic releases on the spanning trees of suitable graphs
AI总结：
本文提出一种不依赖拉普拉斯矩阵谱的原创算法，通过图内环之间公共边数量计算任意图的生成树集合，并给出Jahangir图类的算法实现、源代码及其在机密信息传输安全中的应用。
摘要：
本文针对某些图，发展了生成树的代数性质、组合性质以及数量的计算方法。为此，讨论了一种独立于图所关联的拉普拉斯矩阵谱的原创方法。该方法代表了计算任意图有多少棵生成树以及哪些边集构成生成树的一种替代过程，其核心在于根据图的内环之间公共边的数量来连接生成树。文中展示了用于确定Jahangir图类所有生成树边集集合的算法及其源代码。给出了一个涉及此类图的应用，以便在传输机密信息时获得令人满意的安全程度，最后强调了这些图的对称性质。
英文摘要：
In this paper algebraic and combinatorial properties and a computation of the number of the spanning trees are developed for certain graphs. To this purpose, an original method, independent of the spectrum of the Laplacian matrix associated to the graph, is discussed. It represents an alternative process to compute how many and which are the spanning trees of any graph and substantially consists in joining the spanning trees on the ground of the number of common edges between the inner cycles of it. The algorithm and its source code for determining the collection of all edge-sets of the spanning trees for the class of Jahangir graphs are displayed. An application involving such graphs in order to get a satisfactory degree of security in transmitting confidential information is given, and finally symmetry properties of them are highlighted.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
