The neighbour-integrity of boolean graphs and its compounds

References

• Arisoy , M. 1997 . Characteristic Polynomials and Spectra of Boolean Graphs . Int. J. Educ. Sci. Technol. , 28 ( 1 ) : 67 – 74 .
   Google Scholar
• Bagga , K. S. and Beineke , L. W. 1992 . Survey of Integrity . Discrete Applied Math. , 37/38 ( 1 ) : 13 – 28 .
   Google Scholar
• Barefoot , C. A. and Entringer , R. 1987 . Vulnerability in Graphs-A Comparative Survey . J. Combin. Math. Combin. Comput. , : 113 – 22 .
   Google Scholar
• Buckley , F. and Harary , F. 1990 . Distance in Graphs , California : Addison-Wesley Pub. .
   Google Scholar
• Cozzens , M. B. 1994 . Stability Measures and Data Fusion Networks . Graph Theory Notes of Newyork , XXVI : 8 – 14 .
   Google Scholar
• Cozzens , M. B. and Wu , S. Y. 1994 . Edge Neighbour-integrity of Trees . Australian J. of Combinatorics , 10 : 163 – 174 .
   Google Scholar
• Cozzens , M. B. and Yu , S. Y. 1996 . Vertex Neighbour-integrity of Trees . Ars. Combinatoria , 43 : 169 – 180 .
   Google Scholar
• Dündar , P. 1989 . The Realization of Boolean Function With Minimum Contact By B n Graphs . J. of Faculty of Science Ege Üniv. Series A , 12 ( 2 ) : 61 – 67 .
   Google Scholar
• Goddard , W. and Swart , H. C. 1990 . The Toughness of A Graph . Questiones Math. , 13 ( 2 ) : 217 – 232 .
   Google Scholar
• Kumar , V. and Karpis , G. 1994 . “ Introduction to Parallel Computing ” . In Design and Analysis of Algorithms , 81 – 107 . California : The Benjamin/Commings Publ. .
   Google Scholar