The neighbour-integrity of boolean graphs and its compounds
From MaRDI portal
Publication:4944661
DOI10.1080/00207169908804867zbMath0942.68098OpenAlexW1969859239MaRDI QIDQ4944661
Publication date: 21 March 2000
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207169908804867
Applications of graph theory (05C90) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Connectivity (05C40)
Related Items (3)
Finding a fault tolerant routing on neighbour-faulty hypercube ⋮ Stability measures of some static interconnection networks ⋮ Calculation of the accessibility number and the neighbor integrity of a graph
Cites Work
This page was built for publication: The neighbour-integrity of boolean graphs and its compounds