On the neighbour-integrity of sequential joined graphs

DOI10.1080/00207160008804921zbMath0961.05044OpenAlexW2070974525MaRDI QIDQ4951742

Aysun Ozan, Pinar Dundar

Publication date: 22 November 2000

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160008804921

zbMATH Keywords

vertex-neighbor-integrity

Mathematics Subject Classification ID

Connectivity (05C40)

Related Items (5)

Finding a fault tolerant routing on neighbour-faulty hypercube ⋮ Stability measures of some static interconnection networks ⋮ Vulnerability in graphs: the neighbour-integrity of line graphs ⋮ Calculation of the accessibility number and the neighbor integrity of a graph ⋮ Unnamed Item

Cites Work

• A survey of integrity
• Edge-integrity: A survey
• On the honesty of graph complements
• Tough graphs and Hamiltonian circuits.
• On the Toughness of a Graph
• The worst case complexity of the fredholm equation with periodic free term and noisy information^∗
• Unnamed Item
• Unnamed Item

This page was built for publication: On the neighbour-integrity of sequential joined graphs