Extremal inverse eigenvalue problem for matrices described by a connected unicyclic graph
Applications of Mathematics, Tome 69 (2024) no. 2, pp. 273-286
Voir la notice de l'article provenant de la source Czech Digital Mathematics Library
In this paper, we deal with the construction of symmetric matrix whose corresponding graph is connected and unicyclic using some pre-assigned spectral data. Spectral data for the problem consist of the smallest and the largest eigenvalues of each leading principal submatrices. Inverse eigenvalue problem (IEP) with this set of spectral data is generally known as the extremal IEP. We use a standard scheme of labeling the vertices of the graph, which helps in getting a simple relation between the characteristic polynomials of each leading principal submatrix. Sufficient condition for the existence of the solution is obtained. The proof is constructive, hence provides an algorithmic procedure for finding the required matrix. Furthermore, we provide the condition under which the same problem is solvable when two particular entries of the required matrix satisfy a linear relation.
Classification :
05C50, 15A24, 65F18
Keywords: inverse eigenvalue problem; unicyclic graph; leading principal submatrices
Keywords: inverse eigenvalue problem; unicyclic graph; leading principal submatrices
@article{10_21136_AM_2024_0084_23,
author = {Bardhan, Bijoya and Sen, Mausumi and Sharma, Debashish},
title = {Extremal inverse eigenvalue problem for matrices described by a connected unicyclic graph},
journal = {Applications of Mathematics},
pages = {273--286},
publisher = {mathdoc},
volume = {69},
number = {2},
year = {2024},
doi = {10.21136/AM.2024.0084-23},
language = {en},
url = {http://geodesic.mathdoc.fr/articles/10.21136/AM.2024.0084-23/}
}
TY - JOUR AU - Bardhan, Bijoya AU - Sen, Mausumi AU - Sharma, Debashish TI - Extremal inverse eigenvalue problem for matrices described by a connected unicyclic graph JO - Applications of Mathematics PY - 2024 SP - 273 EP - 286 VL - 69 IS - 2 PB - mathdoc UR - http://geodesic.mathdoc.fr/articles/10.21136/AM.2024.0084-23/ DO - 10.21136/AM.2024.0084-23 LA - en ID - 10_21136_AM_2024_0084_23 ER -
%0 Journal Article %A Bardhan, Bijoya %A Sen, Mausumi %A Sharma, Debashish %T Extremal inverse eigenvalue problem for matrices described by a connected unicyclic graph %J Applications of Mathematics %D 2024 %P 273-286 %V 69 %N 2 %I mathdoc %U http://geodesic.mathdoc.fr/articles/10.21136/AM.2024.0084-23/ %R 10.21136/AM.2024.0084-23 %G en %F 10_21136_AM_2024_0084_23
Bardhan, Bijoya; Sen, Mausumi; Sharma, Debashish. Extremal inverse eigenvalue problem for matrices described by a connected unicyclic graph. Applications of Mathematics, Tome 69 (2024) no. 2, pp. 273-286. doi: 10.21136/AM.2024.0084-23
Cité par Sources :