A note on the vertex-switching reconstruction

I. Krasikov

International Journal of Mathematics and Mathematical Sciences, 1988, vol. 11, 1-3

Abstract:

Bounds on the maximum and minimum degree of a graph establishing its reconstructibility from the vertex switching are given. It is also shown that any disconnected graph with at least five vertices is reconstructible.

Date: 1988
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/IJMMS/11/932869.pdf (application/pdf)
http://downloads.hindawi.com/journals/IJMMS/11/932869.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jijmms:932869

DOI: 10.1155/S0161171288001012

Access Statistics for this article

More articles in International Journal of Mathematics and Mathematical Sciences from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().