Corrigendum to “Achievable Multiplicity partitions in the Inverse Eigenvalue Problem of a graph” [Spec. Matrices 2019; 7:276-290.]

Corrigendum to “Achievable Multiplicity partitions in the Inverse Eigenvalue Problem of a graph” [Spec. Matrices 2019; 7:276-290.]

We correct an error in the original Lemma 3.4 in our paper “Achievable Multiplicity partitions in the IEVP of a graph”’ [Spec. Matrices 2019; 7:276-290.]. We have re-written Section 3 accordingly.

Bibliographic Details
Main Authors: Adm Mohammad, Fallat Shaun, Meagher Karen, Nasserasr Shahla, Plosker Sarah, Yang Boting
Format: Article
Language:English
Published: De Gruyter 2020-11-01
Series:Special Matrices
Subjects:
inverse eigenvalue problem
multiplicity partition
adjacency matrix
minimum rank
distinct eigenvalues
graphs
05c50
15a18
Online Access:https://doi.org/10.1515/spma-2020-0117
id doaj-ab70ca22e2a84ee8810d87cee8c06cd2
record_format Article
spelling doaj-ab70ca22e2a84ee8810d87cee8c06cd22021-10-02T19:10:40ZengDe GruyterSpecial Matrices2300-74512020-11-018123524110.1515/spma-2020-0117spma-2020-0117Corrigendum to “Achievable Multiplicity partitions in the Inverse Eigenvalue Problem of a graph” [Spec. Matrices 2019; 7:276-290.]Adm Mohammad0Fallat Shaun1Meagher Karen2Nasserasr Shahla3Plosker Sarah4Yang Boting5Department of Applied Mathematics and Physics, Palestine Polytechnic University, Hebron, Palestine Department of Mathematics and Statistics, University of Konstanz, Konstanz, GermanyDepartment of Mathematics and Statistics, University of Regina, Regina, SK, S4S 0A2, CanadaDepartment of Mathematics and Statistics, University of Regina, Regina, SK, S4S 0A2, CanadaDepartment of Mathematics and Computer Science, Brandon University, Brandon, MB R7A 6A9, Canada and School of Mathematical Sciences, Rochester Institute of Technology, Rochester, NY, 14623, USA.Department of Mathematics and Statistics, University of Regina, Regina, SK, S4S 0A2, CanadaDepartment of Mathematics and Computer Science, Brandon University, Brandon, MB R7A 6A9, CanadaDepartment of Computer Science, University of Regina, Regina, SK, S4S 0A2, CanadaWe correct an error in the original Lemma 3.4 in our paper “Achievable Multiplicity partitions in the IEVP of a graph”’ [Spec. Matrices 2019; 7:276-290.]. We have re-written Section 3 accordingly.https://doi.org/10.1515/spma-2020-0117inverse eigenvalue problemmultiplicity partitionadjacency matrixminimum rankdistinct eigenvaluesgraphs05c5015a18
collection DOAJ
language English
format Article
sources DOAJ
author Adm Mohammad
Fallat Shaun
Meagher Karen
Nasserasr Shahla
Plosker Sarah
Yang Boting
spellingShingle Adm Mohammad
Fallat Shaun
Meagher Karen
Nasserasr Shahla
Plosker Sarah
Yang Boting
Corrigendum to “Achievable Multiplicity partitions in the Inverse Eigenvalue Problem of a graph” [Spec. Matrices 2019; 7:276-290.]
Special Matrices
inverse eigenvalue problem
multiplicity partition
adjacency matrix
minimum rank
distinct eigenvalues
graphs
05c50
15a18
author_facet Adm Mohammad
Fallat Shaun
Meagher Karen
Nasserasr Shahla
Plosker Sarah
Yang Boting
author_sort Adm Mohammad
title Corrigendum to “Achievable Multiplicity partitions in the Inverse Eigenvalue Problem of a graph” [Spec. Matrices 2019; 7:276-290.]
title_short Corrigendum to “Achievable Multiplicity partitions in the Inverse Eigenvalue Problem of a graph” [Spec. Matrices 2019; 7:276-290.]
title_full Corrigendum to “Achievable Multiplicity partitions in the Inverse Eigenvalue Problem of a graph” [Spec. Matrices 2019; 7:276-290.]
title_fullStr Corrigendum to “Achievable Multiplicity partitions in the Inverse Eigenvalue Problem of a graph” [Spec. Matrices 2019; 7:276-290.]
title_full_unstemmed Corrigendum to “Achievable Multiplicity partitions in the Inverse Eigenvalue Problem of a graph” [Spec. Matrices 2019; 7:276-290.]
title_sort corrigendum to “achievable multiplicity partitions in the inverse eigenvalue problem of a graph” [spec. matrices 2019; 7:276-290.]
publisher De Gruyter
series Special Matrices
issn 2300-7451
publishDate 2020-11-01
description We correct an error in the original Lemma 3.4 in our paper “Achievable Multiplicity partitions in the IEVP of a graph”’ [Spec. Matrices 2019; 7:276-290.]. We have re-written Section 3 accordingly.
topic inverse eigenvalue problem
multiplicity partition
adjacency matrix
minimum rank
distinct eigenvalues
graphs
05c50
15a18
url https://doi.org/10.1515/spma-2020-0117
work_keys_str_mv AT admmohammad corrigendumtoachievablemultiplicitypartitionsintheinverseeigenvalueproblemofagraphspecmatrices20197276290
AT fallatshaun corrigendumtoachievablemultiplicitypartitionsintheinverseeigenvalueproblemofagraphspecmatrices20197276290
AT meagherkaren corrigendumtoachievablemultiplicitypartitionsintheinverseeigenvalueproblemofagraphspecmatrices20197276290
AT nasserasrshahla corrigendumtoachievablemultiplicitypartitionsintheinverseeigenvalueproblemofagraphspecmatrices20197276290
AT ploskersarah corrigendumtoachievablemultiplicitypartitionsintheinverseeigenvalueproblemofagraphspecmatrices20197276290
AT yangboting corrigendumtoachievablemultiplicitypartitionsintheinverseeigenvalueproblemofagraphspecmatrices20197276290
_version_ 1716848064888569856

Similar Items