当前位置:
X-MOL 学术
›
Graphs Comb.
›
论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Contractible Edges and Contractible Triangles in a 3-Connected Graph
Graphs and Combinatorics ( IF 0.7 ) Pub Date : 2021-06-22 , DOI: 10.1007/s00373-021-02354-1 Kiyoshi Ando , Yoshimi Egawa
中文翻译:
三连通图中的可收缩边和可收缩三角形
更新日期:2021-06-23
Graphs and Combinatorics ( IF 0.7 ) Pub Date : 2021-06-22 , DOI: 10.1007/s00373-021-02354-1 Kiyoshi Ando , Yoshimi Egawa
Let G be a 3-connected graph. An edge (a triangle) of G is said to be a 3-contractible edge (a 3-contractible triangle) if the contraction of it results in a 3-connected graph. We denote by \(E_{c}(G)\) and \(\mathcal {T}_{c}(G)\) the set of 3-contractible edges of G and the set of 3-contractible triangles of G, respectively. We prove that if \(|V(G)|\ge 7\), then \(|E_{c}(G)|+ \frac{15}{14}|\mathcal {T}_{c}(G)|\ge \frac{6}{7}|V(G)|.\) We also determine the extremal graphs.
中文翻译:
三连通图中的可收缩边和可收缩三角形
令G为三连通图。如果G 的边(三角形)的收缩导致 3-连通图,则称其为 3-可收缩边(3-可收缩三角形)。我们用\(E_ {C}(G)\)和\(\ mathcal【T} _ {C}(G)\)的组的3-收缩边的ģ和该组的3-收缩三角形ģ, 分别。我们证明如果\(|V(G)|\ge 7\),那么\(|E_{c}(G)|+ \frac{15}{14}|\mathcal {T}_{c}( G)|\ge \frac{6}{7}|V(G)|.\)我们还确定了极值图。