Sufficient Condition for Hamiltonian Graphs Concerning Degree and Neighborhood Union

IntroductionWeuseBondyandMurty[1]forterminologyandnotationnotdefinedhereandconsidersimplegraphsonly.LetGbeagraphofordern.Foranya∈V(G),AV(G)orasubgraphAofG,andanysubgraphHofG,NH(a)={v∈V(H):av∈E(G)}NH(A)=∪v∈ANH(v)=NH(V(A)).DenoteNG(a)=N(a),dH(v)=|NH(v)|,andthedegreeofvbyd(v)=|N(v)|.Letα=max{|S||SisanindependentsetofG},δ=min{d(u)|u∈V(G)}.LetSandTbetwosubsetofG,thenweusee(S,T)todenotethecardinalityofedgeswhichjointStoTandG[S]isasubgraphofGinducedbyS.Thedistance,denote…     

一种波形匹配新算法:V-P-V算法─—用于中文签名真伪识别

提出了一种度量波形相似度的新算法，并用于中文签名真伪识别．该算法将波形切割成一串相关联的峰一谷一峰（Ｖ－Ｐ－Ｖ）子元，通过插入、删除和替代三种操作的代价来计算两串的距离，由此得到两波形的相似度．算法的时间复杂性为Ｏ（ｎ×ｍ），ｎ与ｍ分别为两波形串的子元数目．文中给出的Ｖ－Ｐ－Ｖ算法已用于中文签名真伪识别系统，并获得了满意的结果．     

Pancyclism in Claw-free Graphs

IntroductionUsethegraphtheorywithapplications[1]forterminologyandnotationnotdefinedhereandconsidersimplegraphsonly.LetGbeagraphofordern.Foranya∈V(G),AV(G)orasubgraphAofG,andanysubgraphHofG,letNH(a)={v∈V(H):av∈E(G)},NH(A)=∪v∈ANH(v)=NH(V(A)).SetNG(a)=N(a),thedegreeofvbyd(v)=|N(v)|andΔ=max{d(u)|u∈V(G)}.Thedistance,denotedbyd(u,v),betweentwoverticesuandvofaconnectedgraphistheminimumlengthofallpathsjoininguandv.AgraphGiscalledclaw-freeifGhasnoinducedsubgraphisomorphictoK1,3.G…     

Claw─centre Independent Graphs

Ｃｌａｗ┐ｃｅｎｔｒｅＩｎｄｅｐｅｎｄｅｎｔＧｒａｐｈｓＬｕＭｅｉ（陆玫）ＤｅｐａｒｔｍｅｎｔｏｆＡｐｐｌｉｅｄＭａｔｈｅｍａｔｉｃｓ，ＴｓｉｎｇｈｕａＵｎｉｖｅｒｓｉｔｙ，Ｂｅｉｊｉｎｇ１０００８４Ａｂｓｔｒａｃｔ：ＩｆＦｉｓａｇｒａｐｈ，ｔｈｅｎ...     

一种波形匹配新算法：V—P—V算法——用于中文签名真伪识别

提出了一种度量波形相似度的新长法，并用于中文签名真伪识别。该算法将波形切割成一串相关联的峰－谷－峰子元，通过插入，删除和替代三种操作的代价来计算两串的距离，由此得到两波形的相似度。