Bollobas and Gyarfas conjectured that for n 〉 4（k - 1） every 2-edge-coloring of Kn contains a monochromatic k-connected subgraph with at least n - 2k ＋ 2 vertices. Liu, et al. proved that the conjecture holds when...Bollobas and Gyarfas conjectured that for n 〉 4（k - 1） every 2-edge-coloring of Kn contains a monochromatic k-connected subgraph with at least n - 2k ＋ 2 vertices. Liu, et al. proved that the conjecture holds when n 〉 13k - 15. In this note, we characterize all the 2-edge-colorings of Kn where each monochromatic k-connected subgraph has at most n - 2k ＋ 2 vertices for n ≥ 13k - 15.展开更多
电力系统分析综合程序(Power System Analysis Synthesis Program,PSASP)对变电站母线拓扑结构做了简化,潮流计算中不能反映变电站内部各引流线及CT潮流变化。通过分析PSASP程序和3/2接线方式的特点,提出了增加母线节点法和断面定义法...电力系统分析综合程序(Power System Analysis Synthesis Program,PSASP)对变电站母线拓扑结构做了简化,潮流计算中不能反映变电站内部各引流线及CT潮流变化。通过分析PSASP程序和3/2接线方式的特点,提出了增加母线节点法和断面定义法两种解决方案,并通过实际案例进行了验证。应用结果表明:两种方案均能够有效解决3/2接线中CT过载无法观测的问题。展开更多
M.Farber 等在[2]中引入了“边不交的生成树对”的变换图τ_2(G)的定义,证明了它是连通的.本文讨论了τ_2(G)的连通度,得到了一个下界.特别地,对于2-补树图,即恰含有两个边不交的生成树的图,本文先给出了一种递归方法去构造全体2-补树图...M.Farber 等在[2]中引入了“边不交的生成树对”的变换图τ_2(G)的定义,证明了它是连通的.本文讨论了τ_2(G)的连通度,得到了一个下界.特别地,对于2-补树图,即恰含有两个边不交的生成树的图,本文先给出了一种递归方法去构造全体2-补树图,然后证明了2-补树图 G 的τ_2(G)的连通度≥|V(G)|-1,井给出了例子,说明这一下界是最佳可能的.展开更多
基金Supported by the National Natural Science Foundation of China(10701065 and 11101378)Zhejiang Provincial Natural Science Foundation(LY14A010009)
文摘Bollobas and Gyarfas conjectured that for n 〉 4（k - 1） every 2-edge-coloring of Kn contains a monochromatic k-connected subgraph with at least n - 2k ＋ 2 vertices. Liu, et al. proved that the conjecture holds when n 〉 13k - 15. In this note, we characterize all the 2-edge-colorings of Kn where each monochromatic k-connected subgraph has at most n - 2k ＋ 2 vertices for n ≥ 13k - 15.
基金Supported by National Natural Science Foundation of China(No.11071002)Program for New Century Excellent Talents in University,Key Project of Chinese Ministry of Education(No.210091)+4 种基金Specialized Research Fund for the Doctoral Program of Higher Education(No.20103401110002)Science and Technological Fund of Anhui Province for Outstanding Youth(No.10040606Y33)National Science Foundation of the Department of Education of Anhui Province(Nos.KJ2011A195,KJ2010B136)Scientific Research Fund for Fostering Distinguished Young Scholars of Anhui University(No.KJJQ1001)Project for Academic Innovation Team of Anhui University(No.KJTD001B)
文摘电力系统分析综合程序(Power System Analysis Synthesis Program,PSASP)对变电站母线拓扑结构做了简化,潮流计算中不能反映变电站内部各引流线及CT潮流变化。通过分析PSASP程序和3/2接线方式的特点,提出了增加母线节点法和断面定义法两种解决方案,并通过实际案例进行了验证。应用结果表明:两种方案均能够有效解决3/2接线中CT过载无法观测的问题。
文摘M.Farber 等在[2]中引入了“边不交的生成树对”的变换图τ_2(G)的定义,证明了它是连通的.本文讨论了τ_2(G)的连通度,得到了一个下界.特别地,对于2-补树图,即恰含有两个边不交的生成树的图,本文先给出了一种递归方法去构造全体2-补树图,然后证明了2-补树图 G 的τ_2(G)的连通度≥|V(G)|-1,井给出了例子,说明这一下界是最佳可能的.
