Stability measures of some static interconnection networks

References

• Akers , S.B. , Harel , D. and Krishnamurty , B. . The Star Graphs: An Attractive Alternative to n-cube . Proc. Int. Conf. Parallel Processing . pp. 393 – 400 .
   Google Scholar
• Akers , S.B. , Harel , D. and Krishnamurty , B. 1989 . Group-Theoretic Model for Symmetric Interconnection Networks . IEEE Trans. Computers , 38 ( 4 ) April : 555 – 565 .
   Web of Science ®Google Scholar
• Akl , S.G. , Qiu , K. and Stojmeninoviç , I. 1993 . Fundamental Algorithms for the Star and Pancake Interconnection Network with Applications to Computational Geometry . Networks , 23 ( 4 ) July : 215 – 225 .
   Web of Science ®Google Scholar
• Bagga , K.S. , Beineke , L.W. , Goddard , W.D. , Lipman , M.J. and Pippert , R.E. 1992 . A survey of integrity . Discrete Applied Math , 37/38 ( 4 ) July : 13 – 28 .
   Google Scholar
• Bagga , K.S. , Beineke , L.W. , Pippert , R.E. and Sedlmeyer , R.L. 1993 . Some bounds and an algorithm for the edge-integrity of trees . Ars Combinatorial , 35-A ( 4 ) July : 225 – 238 .
   Google Scholar
• Bagga , K.S. , Beineke , L.W. and Pippert , R.E. 1993 . On the honesty of graph complements . Discrete Math , 122 ( 4 ) July : 1 – 6 .
   Google Scholar
• Bagga , K.S. , Beineke , L.W. and Pippert , R.E. 1994 . Edge integrity: a survey . Discrete Math , 124 ( 4 ) July : 3 – 12 .
   Google Scholar
• Barefoot , C.A. , Entringer , R. and Swart , H. 1987 . Vulnerability in graphs – a comparative survey . J. Comb. Math. Comb. Comput , 1 ( 4 ) July : 13 – 22 .
   Google Scholar
• Barefoot , C.A. , Entringer , R. and Swart , H. 1987 . Integrity of trees and powers of cycles . Congressus Numerantium , 58 ( 4 ) July : 103 – 114 .
   Google Scholar
• Cozzens , B.M. 1994 . Stability measures and data fusion networks . Graph Theory Notes of New York , XXVI ( 4 ) July : 8 – 14 .
   Google Scholar
• Cozzens , M. , Moazzami , D. and Stueckle , S. . The tenacity of a graph. Graph theory, combinatorisc, algorithms and applications . Proceedings of the Seventh Quadrennial International Conference on the Theory and Applications of Graphs . June 15 1992 , Kalamazoo, MI, USA. Vol. 2 , pp. 1111 – 1122 . New York, NY : Wiley .
   Google Scholar
• Cozzens , M. , Moazzami , D. and Stueckle , S. 1994 . The tenacity of Harary graphs . J. Comb. Math. Comb. Comput , 16 : 33 – 56 .
   Google Scholar
• Cozzens , M. and Wu , S. 1997 . Bounds of edge-neighbor-integrity of graphs . Australian J. of Combinatorics , 15 : 71 – 80 .
   Google Scholar
• Dündar , P. . The Stability Measures of Static Interconnection Networks and Binary Trees . Proceeding of the Third International Symposium on Computer Networks . İzmir, Turkey. pp. 240 – 245 .
   Google Scholar
• Dündar , P. and Ozan , A. 1999 . “ Stability Measures of Torus and Mesh Graphs ” . In IEEE Pro. Communication submitted
   Google Scholar
• Dündar , P. 1999 . “ The Neighbour-Tenacity of a Graph ” . In Ars Combinatoria submitted
   Google Scholar
• Dündar , P. 1999 . The Tenacities of Hypercube Graphs and its Some Compounds . Neural Networks World , 3/99 : 225 – 234 .
   Google Scholar
• Dündar , P. , Ozan , A. and Gürtunca , A. 1999 . “ The Tenacity of The Complete Thorny Graphs ” . In Math. Utilities submitted
   Google Scholar
• Dündar , P. 1999 . Neighbour-integrity of Boolean Graphs and Its Compounds . Int. J. Comput. Math , 72 : 441 – 447 .
   Web of Science ®Google Scholar
• Dündar , P. 2000 . Neighbour-integrity of Sequential Joined Graphs . Int. J. of Comput. Math , 74 : 45 – 52 .
   Web of Science ®Google Scholar
• Dündar , P. and Gürtunca , A. 1999 . “ The Neighbour-Integrity of Complete Thorny Graphs ” . In Quaestiones Math submitted
   Google Scholar
• Dündar , P. 1999 . New Notions in Network Reliability: Stability Numbers of Sequential Joined Graphs . Neural Networks World , 5 : 403 – 411 .
   Google Scholar
• Harary , F. and Buckley , F. 1990 . Distance in graphs , California : Addison-Wesley .
   Google Scholar
• Lesniak , L. and Chartrand , G. 1986 . Graphs and digraphs , California : Wadsworth & Brooks .
   Google Scholar
• Kumar , V. , Grama , A. , Gupta , A. and Karpis , G. 1994 . Introduction to parallel computing , California : The Benjamin Cummings .
   Google Scholar
• Tseng , Y. , Chang , S. and Sheu , J. 1997 . Fault-tolerant Ring Embedding in a Star Graph with Both Link and Node Failures . IEEE Trans. on Parallel and Distributed Syst , 8 ( 12 ) December : 1185 – 1195 .
   Web of Science ®Google Scholar