Distance hereditary graphs G of connectivity two or three...

Distance hereditary graphs G of connectivity two or three and diam(G) = diam(G̅) = 3 are reconstructible

Devi Priya, P., Monikandan, S.
How much do you like this book?
What’s the quality of the file?
Download the book for quality assessment
What’s the quality of the downloaded files?
Volume:
50
Language:
english
Journal:
Indian Journal of Pure and Applied Mathematics
DOI:
10.1007/s13226-019-0339-2
Date:
June, 2019
File:
PDF, 196 KB
english, 2019
Conversion to is in progress
Conversion to is failed