2 papers
math.CO2020
-Core Distance Partitions
Xandru Mifsud
The -core vertices of a graph correspond to the non-zero entries of some eigenvector of for a universal adjacency matrix of the graph. We define a partition of…
math.CO2020
Nullspace Vertex Partition in Graphs
Irene Sciriha, Xandru Mifsud, James Borg
The core vertex set of a graph is an invariant of the graph. It consists of those vertices associated with the non-zero entries of the nullspace vectors of a -adjacency ma…