1 citations · 1 across the 2 of their papers we have counts for
3 papers
math.CO2019
A note on the spectra and eigenspaces of the universal adjacency matrices of arbitrary lifts of graphs
C. Dalfó, M. A. Fiol, S. Pavlíková +1
The universal adjacency matrix of a graph , with adjacency matrix , is a linear combination of , the diagonal matrix of vertex degrees, the identity matrix , an…
math.CO2019
Spectra and eigenspaces of arbitrary lifts of graphs
C. Dalfó, M. A. Fiol, S. Pavlíková +1
We describe, in a very explicit way, a method for determining the spectra and bases of all the corresponding eigenspaces of arbitrary lifts of graphs (regular or not).
math.CO2017★ 1 cited
Inverting non-invertible trees
Soňa Pavlíková, Jozef Širáň
If a graph has a non-singular adjacency matrix, then one may use the inverse matrix to define a (labeled) graph that may be considered to be the inverse graph to the original one.…