Codeterminantal graphs

Autor:	Aida Abiad, Carlos A. Alfaro, Kristin Heysse, Marcos C. Vargas
Přispěvatelé:	Combinatorial Optimization 1, EAISI Foundational, Mathematics, Digital Mathematics
Jazyk:	angličtina
Rok vydání:	2022
Předmět:	Sandpile group Numerical Analysis Algebra and Number Theory Determinantal ideal Cospectral graph Discrete Mathematics and Combinatorics Geometry and Topology Smith normal form Distance Laplacian matrix Graph spectrum
Zdroj:	Linear Algebra and Its Applications, 650, 1-25. Elsevier
ISSN:	0024-3795
DOI:	10.1016/j.laa.2022.05.021
Popis:	We introduce the concept of codeterminantal graphs, which generalize the concepts of cospectral and coinvariant graphs. To do this, we investigate the relationship of the spectrum and the Smith normal form (SNF) with the determinantal ideals. We establish a necessary and sufficient condition for graphs to be codeterminantal on R[x], and we present some computational results on codeterminantal graphs up to 9 vertices. Finally, we show that complete graphs and star graphs are determined by the SNF of its distance Laplacian matrix.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_dedup___::91e66a1a83e259fb59bf209b5fc9113a https://doi.org/10.1016/j.laa.2022.05.021 Zobrazit plný text záznamu Full Text from ScienceDirect