论文信息 - Minimum Spanning Tree Cycle Intersection Problem

Minimum Spanning Tree Cycle Intersection Problem

Consider a connected graph G and let T be a spanning tree of G. Every edge e ∈ G−T induces a cycle in T ∪ {e}. The intersection of two distinct such cycles is the set of edges of T that belong to both cycles. We consider the problem of finding a spanning tree that has the least number of such non-empty intersections.

[1] P. Alam. ‘A’ , 2021, Composites Engineering: An A–Z Guide.

[2] Ante Graovac,et al. Atom-bond connectivity index of trees , 2009, Discret. Appl. Math..

[3] Joseph Douglas Horton,et al. A Polynomial-Time Algorithm to Find the Shortest Cycle Basis of a Graph , 1987, SIAM J. Comput..

[4] Kurt Mehlhorn,et al. Cycle bases in graphs characterization, algorithms, complexity, and applications , 2009, Comput. Sci. Rev..

[5] Ernesto Estrada,et al. AN ATOM-BOND CONNECTIVITY INDEX : MODELLING THE ENTHALPY OF FORMATION OF ALKANES , 1998 .

[6] Sven de Vries,et al. Minimum Cycle Bases for Network Graphs , 2004, Algorithmica.

[7] Romeo Rizzi,et al. Classes of cycle bases , 2007, Discret. Appl. Math..

[8] Oswald Veblen,et al. An Application of Modular Equations in Analysis Situs , 2022 .

[9] Saunders Mac Lane,et al. A combinatorial condition for planar graphs , 1937 .

[10] Narsingh Deo,et al. Algorithms for Generating Fundamental Cycles in a Graph , 1982, TOMS.

[11] F. McMorris,et al. Topics in Intersection Graph Theory , 1987 .

[12] Brendan D. McKay,et al. Practical graph isomorphism, II , 2013, J. Symb. Comput..

[13] Julia Collins,et al. HOMOLOGICAL ALGEBRA , 2021, Lie Groups, Lie Algebras, and Cohomology. (MN-34), Volume 34.

[14] I. Gutman. Degree-Based Topological Indices , 2013 .