检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《应用数学学报》2010年第6期982-989,共8页Acta Mathematicae Applicatae Sinica
基 金:内蒙古高校科研(NJ04069)资助项目
摘 要:2007年,Wang等得到了关于不包含环的DNA标号图的一个结果,在此基础上我们推广到一般有向图上,即任何无孤立点的有向图在友关系下恰有—个等价类的充要条件,并得出几个相应的改进结果.本文还给出了一个定理的反例,进而得到定理的修正和完善.由此容易推出Wang等的一个定理的必要条件也是充分的.In 2007,Wang obtained a result about DNA labeling graphs which do not contain loops.On this basis,we generalized a sufficient and necessary condition for general directed graphs.We conclude that the sufficient and necessary condition for any directed graphs,which do not contain isolated vertices have and only have a equivalence class under the friend relationship and we draw some improved results accordingly.A counterexample of a theorem is given,too.Furthermore,we modified and completed this theorem.It is easy to deduce that the necessary condition for the theorem in Wang's research is also a sufficient condition.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.145.152.138