A Note on Vertex-Neighbor-Integrity of Sequential-Joined Graphs

Article Preview

Abstract:

The graphical parameter vertex-neighbor-integrity was introduced by Cozzens to measure invulnerability of networks. Dündar and Ozan discussed this parameter's properties of sequential-joined graphs. Unfortunately, the authors considered some special cases only and many mistakes appeared in their work. In this paper, based on our works done in 2005, we correct Dündar and Ozan's mistakes and discuss some related questions.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

639-641

Citation:

Online since:

February 2014

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2014 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] M. Cozzens and S. Wu, Vertex-Neighbor-Integrity of Trees, Ars Combinatoria 43 (1996), 169-180.

Google Scholar

[2] Z. Wei, M. Li and A. Mai, Vertex-neighbor-integrity of sequential joined graphs, Basic Sciences Journal of Textile Universities, 18 (3) (2005), 202-206.

Google Scholar

[3] P. Dündar and A. Ozan, On the neighbor-integrity of sequential joined graphs, International. J. Computer Math. 74 (2000) 45-52.

DOI: 10.1080/00207160008804921

Google Scholar