A new kind of Hermitian matrices for digraphs

About

In an earlier work, the author together with Guo [Hermitian adjacency matrix of digraphs and mixed graphs, J. Graph Theory 85 (2017) 217-248] introduced the Hermitian adjacency matrix of directed (and partially directed) graphs. However, it appears that a more natural Hermitian matrix exists, and it is the purpose of this note to bring this new Hermitian matrix to the attention of researchers in algebraic graph theory.

Bojan Mohar · 2019

Related benchmarks

Task	Dataset	Result
Clustering	PolBlogs	AMI21	11
Clustering	email-EU	AMI35	11
Clustering	DiSBM-Chain	AMI0.44	11
Clustering	Wine K-NN digraph	AMI49	11
Clustering	WDBC K-NN digraph	AMI13	11
Clustering	K-NN digraph	AMI6	11
Clustering	Olivetti K-NN digraph	AMI53	11
Clustering	DiSBM-CP	AMI0.28	11
Clustering	Iris K-NN digraph	AMI0.2	11
Clustering	Control Chart K-NN digraph	AMI45	11