Abstract An f-coloring of a graph G is an edge-coloring of G such that each color appears at each vertex v ∈ V(G) at most f(v) times. The f-core of G is the subgraph of G induced by the vertices v of degree d(v...Abstract An f-coloring of a graph G is an edge-coloring of G such that each color appears at each vertex v ∈ V(G) at most f(v) times. The f-core of G is the subgraph of G induced by the vertices v of degree d(v) = f(v)maxv∈y(G){ [d(v)/f(v)l}. In this paper, we find some necessary conditions for a simple graph, whose f-core has maximum degree two, to be of class 2 for f-colorings.展开更多
为了满足移动通信系统中功率放大器宽频带和高效率的需求,采用阶梯阻抗网络实现宽带匹配电路,设计了一款高效率连续逆F类功率放大器。选用CGH40010F GaN HEMT晶体管,通过对连续逆F类功率放大器的理论分析,并且结合ADS负载牵引与源牵引仿...为了满足移动通信系统中功率放大器宽频带和高效率的需求,采用阶梯阻抗网络实现宽带匹配电路,设计了一款高效率连续逆F类功率放大器。选用CGH40010F GaN HEMT晶体管,通过对连续逆F类功率放大器的理论分析,并且结合ADS负载牵引与源牵引仿真,提取各频点的最佳负载阻抗和源阻抗,设计阶梯阻抗匹配电路,最终实现了一款宽带高效率功率放大器。测试结果表明,该功率放大器在3.2~3.8 GHz频段内,增益大于14 dB,增益平坦度小于±0.4 dB,饱和输出功率为40.6~40.9 dBm,最大漏极效率为64%~68%。该功率放大器的测试性能良好,可以为宽频带高效率功率放大器的设计提供参考。展开更多
基金Supported by National Natural Science Foundation of China(Grant Nos.10901097,11001055)Tianyuan Youth Foundation of Mathematics(Grant No.10926099)+1 种基金Natural Science Foundation of Shandong(Grant No.ZR2010AQ003)Shandong Province Higher Educational Science and Technology Program(Grant No.G13LI04)of China
文摘Abstract An f-coloring of a graph G is an edge-coloring of G such that each color appears at each vertex v ∈ V(G) at most f(v) times. The f-core of G is the subgraph of G induced by the vertices v of degree d(v) = f(v)maxv∈y(G){ [d(v)/f(v)l}. In this paper, we find some necessary conditions for a simple graph, whose f-core has maximum degree two, to be of class 2 for f-colorings.