1) Critical groups of a graph
图的临界群
2) On the Critical Group of Bracelets Graph
手镯图的临界群
3) On the Sandpile Group of Two Kinds of Graphs
两类图的临界群
4) group color criticality
群色临界图
1.
G is a group color critical, if for any subgraph H of G,χ_1(H)<χ_1(G), investigate group color criticality of graphs and characterize some graphs which is group color critical, prove that the minimum degree of k group color criticality of graph is k-1,and G is 3 group color critical if and only if G is cycle.
研究了群色临界图的一些性质,给出某些群色临界图的刻划,证明了k群色临界图G的最小度为k-1,且若G是3群色临界图当且仅当G是圈。
5) The Critical Spectrum of C-semigroups
C-半群的临界谱
6) critical groups
临界群
1.
Base on the spliting theorem near infinity (due to Bartsch-Li), we prove a new result concerning on the computation of the critical group at infinity of asymptotically quadratic functionals, which is similar to the corresponding results for the critical groups at isolated critical points.
在 Bartsch- L i建立的在无穷远处的分裂定理的基础上 ,证明一个关于渐近二次泛函在无穷远处的临界群的计算的结果 ,它类似于泛函在孤立临界点处的临界群的相应结
2.
1)are discussed by means of variational method, the critical point theory, especially critical groups and the Morse theory of nonlinear functional analysis, where A is a given n×n positive definite matrix.
本文利用非线性泛函分析中的变分方法，结合临界点理论，特别是临界群与Morse理论，研究了非线性离散特征值问题解的存在性与多重性。
补充资料：图的减缩图(或称图子式)
图的减缩图(或称图子式)
minor of a graph
图的减缩图(或称图子式)【.皿以ofa脚户;MHHoPrpa中a」【补注】设G是一个图(graph)(可以有环及多重边).G的一个减缩图(nullor)是从G中接连进行下述运算而得的任何一个图: i)删去一条边; 五)收缩一条边; 说)去掉一个孤立顶点. NRobe由on与P.D.Se脚aour的图减缩定理(脚Ph nl的。r theon习11)如下所述:已知有限图的无穷序列G，，GZ，…，则存在指标i
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条