Vulnerability in Graphs of Diameter Five
许承德
【期刊名称】《上海大学学报：英文版》 【年(卷),期】2003(007)004
【摘要】The line persistence of a graph G, ρ1 (G) is the minimum number of lines which must be removed to increase the diameter of G. In this paper we give a characterization of graphs of diameter five with ρ1 (G)≥2.
【总页数】6页(P.352-357)
【关键词】线持久性;直径稳定图;不连通图;同构图 【作者】许承德 【
作
者
单
位
】
DepartmentofMathematics,CollegeofSciences,ShanghaiUniversity,Shanghai200436,China 【正文语种】英文 【中图分类】O157.5 【相关文献】
1.Graph-Only Solution of SC Circuits by Two-Graphs and MC-Graph [J], Bohumil Brtnik
2.Some Results on Sum Graph, Integral Sum Graph and Mod Sum Graph [J], ZHANG Ming; YU Hong-quan; MU ttai-lin
3.An efficient algorithm for finding the largest chain graph according to
Vulnerability in Graphs of Diameter Five
VulnerabilityinGraphsofDiameterFive许承德【期刊名称】《上海大学学报：英文版》【年(卷),期】2003(007)004【摘要】ThelinepersistenceofagraphG,ρ1(G)istheminimumnumberoflineswhichm
推荐度：
点击下载文档文档为doc格式
