Some results on normal digraphs

MaRDI QIDQ1355401zbMATH OpenFDO

Authors Mirko Lepović

Publication date 27 May 1997

Published in Indian Journal of Pure \& Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

adjacency matrixdigraph

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Review text

A digraph is normal if the adjacency matrix of the digraph is normal. The author establishes several properties of normal digraphs.

Cited in

(3)

• An upper bound for the energy of radial digraphs
• Lower bounds for the energy of weighted digraphs
• ON THE NORMALITY OF SOME CAYLEY DIGRAPHS WITH VALENCY 2

This page was built for publication: Some results on normal digraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1355401)