Characterization of digraphs with three complementarity eigenvalues
Given a digraph D, the complementarity spectrum of the digraph is defined as the set of
complementarity eigenvalues of its adjacency matrix. This complementarity spectrum has …
complementarity eigenvalues of its adjacency matrix. This complementarity spectrum has …
Some families of digraphs determined by the complementarity spectrum
D Bravo, F Cubría, M Fiori, G Rama - arXiv preprint arXiv:2403.10665, 2024 - arxiv.org
We examine the capacity of the complementarity spectrum to distinguish non-isomorphic
digraphs. We focus on the seven families with exactly three complementarity eigenvalues …
digraphs. We focus on the seven families with exactly three complementarity eigenvalues …
On Characteristic Polynomial of Antiadjacency Matrix of A Line Digraph
MIA Prayitno, KA Sugeng - Jurnal Matematika UNAND, 2022 - jmua.fmipa.unand.ac.id
In this paper, we find the characteristic polynomial of the antiadjacency matrix of a line
digraph. There are recent studies on the relation between the characteristic polynomial of …
digraph. There are recent studies on the relation between the characteristic polynomial of …