摘要
为描述具有相同连通度、相同核度的两个图在连通程度上的差异，引入了一个新概念——离散度。
This paper introduces a new invariant known as discreteness to measure the extent to which a graph is connected more exactly.The discreteness can describe the difference between the two graphs with equal connectivity and equal coritivity.Several properties and discreteness of graphs are also discussed.
出处
《大连海事大学学报》
CAS
CSCD
1999年第4期74-77,共4页
Journal of Dalian Maritime University
基金
国家自然科学基金
辽宁省教委科学研究项目
关键词
连通
离散度
坚韧度
核度
图
connected graph
connectivity of graph
separating set
toughness
