id	author	title	date	pages	extension	mime	words	sentence	flesch	summary	cache	txt
ejpam-4448	Abudayah, Mohammad Ali; Alomari, Omar; Sander, Torsten	Hermitian Adjacency Matrices of Mixed Graphs	2022	15	.pdf	application/pdf	5822	422	78	Altogether, these arcs and digons form the edge set E(D) of D. The graph G is called the underlying graph Γ(D) of the mixed graphD. Much of the traditional terminology (e.g. being regular, being connected, vertex degree deg(·), maximum degree ∆) that is used for undirected graphs simply carries over to mixed graphs, in the sense that, D is said to have a property whenever Γ(D) has this property. To overcome this obstacle, several authors have recently defined and studied various Hermitian adjacency matrices of digraphs or mixed graphs.	cache/ejpam-4448.pdf	txt/ejpam-4448.txt