Edge-Tenacity in Cycles and Complete Graphs
foundations of computer science(2015)
摘要
It is well known that the tenacity is a proper measure for studying vulnerability and reliability in graphs. Here, a modified edge-tenacity of a graph is introduced based on the classical definition of tenacity. Properties and bounds for this measure are introduced; meanwhile edge-tenacity is calculated for cycle graphs and also for complete graphs.
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要