- 期刊
A NOTE ON THE VERTEX-SWITCHING RECONSTRUCTION
摘要
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.
延伸閱讀
- Chen, Z. H. (2006). The Application of Convolution to Suffix to Prefix Rule for the Exact String Matching Problem [master's thesis, National Chi Nan University]. Airiti Library. https://doi.org/10.6837/NCNU.2006.00021
- Guo, J. Y. (2007). A New Reduction Method for Time Petri Net Systems Using Matching Theory [master's thesis, National Taipei Uinversity]. Airiti Library. https://www.airitilibrary.com/Article/Detail?DocID=U0023-0309200811474000
- SYAU, Y. R. (1999). A NOTE ON CONVEX FUNCTIONS. International Journal of Mathematics and Mathematical Sciences, 1999(), 525-534. https://doi.org/10.1155/S0161171299225252
- Jiang, G. M. (2017). A Robust γ-divergence Based Method to Removing Unwanted Variation [master's thesis, National Taiwan University]. Airiti Library. https://doi.org/10.6342/NTU201700484
- Aasma, A. (2008). On the Acceleration of Convergence by Regular Matrix Methods. Proceedings of the Estonian Academy of Sciences, 57(1), 3-17. https://www.airitilibrary.com/Article/Detail?DocID=17367530-200803-201011080040-201011080040-3-17