On the neighbour-integrity of sequential joined graphs

References

• 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 : 13 – 28 .
   Web of Science ®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. Combinatoria , 35-A : 225 – 238 .
   Google Scholar
• Bagga , K. S. , Beineke , L. W. and Pippert , R. E. 1993 . On The Honesty of Graph Complements . Discrete Math. , 122 : 1 – 6 .
   Google Scholar
• Bagga , K. S. , Beineke , L. W. and Pippert , R. E. 1994 . Edge Integrity: A Survey . Discrete Math. , 124 : 3 – 12 .
   Google Scholar
• Barefoot , C. A. , Entringer , R. and Swart , H. 1987 . Vulnerability in Graphs-A Comparative Survey . J. Comb. Math. Comput. , 1 : 13 – 22 .
   Google Scholar
• Barefoot , C. A. , Entringer , R. and Swart , H. 1987 . Integrity of Trees and Powers of Cycles . Congressus Numeratum , 55 : 103 – 114 .
   Google Scholar
• Chvatal , V. 1973 . Tough Graphs and Hamiltonian Circuits . Discrete Math. , 5 : 215 – 218 .
   Google Scholar
• Cozzens , M. 1994 . Stability Measures and Data Fusion Networks . Graph Theory Notes of New York , XXVI : 8 – 14 .
   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. B. and Wu , S. Y. 1994 . Edge Neighbor-integrity of Trees . Australian J. of Combinatorics , 10 : 163 – 174 .
   Google Scholar
• Cozzens , M. , Moazzami , D. and Stueckle , S. . Proceedings of the Seventh Quadrennial International Conference on the Theory and Applications of Graphs . The Tenacity of A Graph, Graph Theory, Combinatorisc, Algorithms and Applications . June 15 1992 , Kalamazoo, MI, USA. Vol. 2 , pp. 1111 – 1122 . New York, NY : Wiley .
   Google Scholar
• Cozzens , M. B. and Yu , S. Y. 1996 . Vertex Neighbor-integrity of Trees . Ars. Combin. , 43 : 169 – 180 .
   Google Scholar
• Cozzens , M. and Wu , S. Y. 1997 . Bounds of Edge-neighbor-integrity of Graphs . Australian J. of Combinatorics , 15 : 71 – 80 .
   Google Scholar
• Dündar , P. 1998 . Proceeding of the Third International Symposium of Computer Networks, Izmir . The Stability Measures of Static Interconnection Networks and Binary Trees . 1998 . pp. 240 – 245 .
   Google Scholar
• Dündar , P. 1999 . Neighbour-integrity of Boolean Graphs and its Compounds . Int. J. of Comput. Math. , 73 1 – 2 . to appear
   Google Scholar
• Glebov , N. I. and Kostochka , A. V. 1996 . On Minimum Independent Dominating Sets in Graphs . Discrete Analysis and Operations Research , 45 – 58 .
   Google Scholar
• Goddard , W. D. and Swart , H. C. 1990 . On the Toughness of A Graph . Quaestiones Math. , 13 217 – 232 .
   Google Scholar
• Harary , F. and Buckley , F. 1990 . Distance in Graphs , California : Addison-Wesley pub. .
   Google Scholar
• Lesniak , L. and Chartrand , G. 1986 . Graphs and Digraphs , California : Wadsworth and Brooks .
   Google Scholar