%0 Journal Article %1 noauthororeditor %A Javan, Abolfazl %A Akhavan, Mina %A Moeini, Ali %A Moazzami, Dara %D 2015 %J International Journal on Foundations of Computer Science & Technology (IJFCST) %K Edge Graph Tenacity %N 2 %P 8 %R 10.5121/ijfcst.2015.5203 %T EDGE-TENACITY IN CYCLES AND COMPLETE GRAPHS %U https://wireilla.com/papers/ijfcst/V5N2/5215ijfcst03.pdf %V 5 %X 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.

@article{noauthororeditor, abstract = {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. }, added-at = {2023-11-03T13:30:46.000+0100}, author = {Javan, Abolfazl and Akhavan, Mina and Moeini, Ali and Moazzami, Dara}, biburl = {https://www.bibsonomy.org/bibtex/25a76f9455a0ac1305a7ac60503e8e5dd/devino}, doi = {10.5121/ijfcst.2015.5203}, interhash = {d1700a816702d286c8e6c4875d9928c4}, intrahash = {5a76f9455a0ac1305a7ac60503e8e5dd}, issn = {1839-7662}, journal = {International Journal on Foundations of Computer Science & Technology (IJFCST)}, keywords = {Edge Graph Tenacity}, month = mar, number = 2, pages = 8, timestamp = {2023-11-03T13:30:46.000+0100}, title = {EDGE-TENACITY IN CYCLES AND COMPLETE GRAPHS}, url = {https://wireilla.com/papers/ijfcst/V5N2/5215ijfcst03.pdf}, volume = 5, year = 2015 }