The Polynomial of a Directed Graph
From MaRDI portal
Cites work
Cited in
(19)- Polynomial addition sets and polynomial digraphs
- X^k-digraphs
- \(g\)-circulant solutions to the (0,1) matrix equation \(A^m=J_n\)
- An approach to solving \(A^{k}=J-I\)
- Hoffman-type identities
- Directed strongly walk-regular graphs
- Representation of cyclotomic fields and their subfields
- The spectra of subKautz and cyclic Kautz digraphs
- Largest regular multigraphs with three distinct eigenvalues
- Step-size sequence design for finite-time average consensus in secure wireless sensor networks
- Cospectral digraphs from locally line digraphs
- scientific article; zbMATH DE number 3839994 (Why is no real title available?)
- The underlying line digraph structure of some (0, 1)-matrix equations
- Moore mixed graphs from Cayley graphs
- Some inner metric parameters of a digraph: iterated line digraphs and integer sequences
- On the combinatorial structure and algebraic characterizations of distance-regular digraphs
- On commutative association schemes and associated (directed) graphs
- Hoffman polynomials of nonnegative irreducible matrices and strongly connected digraphs
- Spectra of digraphs
This page was built for publication: The Polynomial of a Directed Graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5338794)
