Abstract
We prove that any set of pair-wise nonisomorphic strongly connected weakly cospectral pseudodigraphs whose set of nilpotency indices is finite also is finite.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Bibliography
F. Harary., Graph Theory, Addison-Wesley, Reading, Mass.-MenIo Park, Calif.-London, 1969.
S. P. Strunkov, “On weakly cospectral graphs,” Dokl. Ross. Akad. Nauk [Russian Acad. Sci. Dokl. Math.], 379 (2001), no. 3, 302–304.
S. P. Strunkov, “On weakly cospectral graphs,” Math. Notes, 75 (2004), no. 4, 614–623.
M. Marcus and H. Minc, A Survey of Matrix Theory and Matrix Inequalities, Allyn and Bacon, Inc., Boston, Mass, 1964.
F. R. Gantmacher, The Theory of Matrices, Chelsea Publishing Co., New York, 1959.
Author information
Authors and Affiliations
Additional information
__________
Translated from Matematicheskie Zametki, vol. 80, no. 4, 2006, pp. 627–629.
Original Russian Text Copyright © 2006 by S. P. Strunkov.
Rights and permissions
About this article
Cite this article
Strunkov, S.P. On weakly cospectral graphs. Math Notes 80, 590–592 (2006). https://doi.org/10.1007/s11006-006-0178-4
Received:
Issue Date:
DOI: https://doi.org/10.1007/s11006-006-0178-4