Article Achievable multiplicity partitions in the inverse eigenvalue problem of a graph
Mohammad Adm, Shaun Fallat, Karen Meagher, Shahla Nasserasr, Sarah Plosker, Boting Yang
2019
Adm, Mohammad, Fallat, Shaun, Meagher, Karen, Nasserasr, Shahla, Plosker, Sarah and Yang, Boting. "Achievable multiplicity partitions in the inverse eigenvalue problem of a graph" Special Matrices, vol. 7, no. 1, 2019, pp. 276-290. https://doi.org/10.1515/spma-2019-0022
Adm, M., Fallat, S., Meagher, K., Nasserasr, S., Plosker, S. & Yang, B. (2019). Achievable multiplicity partitions in the inverse eigenvalue problem of a graph. Special Matrices, 7(1), 276-290. https://doi.org/10.1515/spma-2019-0022
Adm, M., Fallat, S., Meagher, K., Nasserasr, S., Plosker, S. and Yang, B. (2019) Achievable multiplicity partitions in the inverse eigenvalue problem of a graph. Special Matrices, Vol. 7 (Issue 1), pp. 276-290. https://doi.org/10.1515/spma-2019-0022
Adm, Mohammad, Fallat, Shaun, Meagher, Karen, Nasserasr, Shahla, Plosker, Sarah and Yang, Boting. "Achievable multiplicity partitions in the inverse eigenvalue problem of a graph" Special Matrices 7, no. 1 (2019): 276-290. https://doi.org/10.1515/spma-2019-0022
Adm M, Fallat S, Meagher K, Nasserasr S, Plosker S, Yang B. Achievable multiplicity partitions in the inverse eigenvalue problem of a graph. Special Matrices. 2019;7(1): 276-290. https://doi.org/10.1515/spma-2019-0022
Copied to clipboard