References
References
- Bagga , KS , Beineke , LW , Goddard , WD , Lipman , MJ and Pippert , RE . (1992) . A survey of integrity . Discrete Appl. Math. , 37/38 : 13 – 28 .
- Cozzens , M and Wu , S . (1997) . Bounds of edge-neighbour-integrity of graphs . Aust. J. Combinatorics , 15 : 71 – 80 .
- Cozzens , M . (1994) . Stability Measures and Data Fusion Networks, Graph Theory Notes of New York , XXVI : pp. 8–14
- Dündar P Kilic E (2003) A Fault Tolerant Routing Algorithm On Neighbour-Faulty Hypercube. EURO 2003, EURO/INFORMS Conference in Istanbul
- Dündar , P and Ozan , A . (2000) . Neighbour-integrity of sequential joined graphs . Int. J. Comput. Math. , 74 : 45 – 52 .
- Dündar , P . (1999) . Neighbour-integrity of Boolean graphs and its compounds . Int. J. Comput. Math. , 72 : 441 – 447 .
- Dündar , P . (2001) . Accessibility number and the neighbour-integrity of generalised petersen graphs . Neural Network World , 2 : 167 – 17 .
- Lesniak L Chartrand G (1986) Graphs and Digraphs, Wadsworth & Brooks California
- Allahverdi , MN and Kahramanli , Ş. Ş. (1996) . Algebraic approach to transformation on hypercube system . Mathe. Comput. Appl. , 1 : 50 – 59 .
- Allahverdi , MN , Kahramanli , Ş. Ş. and Erciyes , KA . (2000) . Fault tolerant routing algorithm based on cube algebra for hypercube . J. Syst. Architec. , 46 : 201 – 205 .
- Kumar V Grama A Gupta A Karpis G (1994) Introduction To Parallel Computing, The Benjamin Cummings Pub. California
- Dündar , P . (1989) . The realization of Boolean function with minimum contact by Q n graph . J. Faculty Sci. Ege Üniv. Ser. A , 12–2 : 61 – 67 .