Homomorphisms, representations and characteristic polynomials of digraphs
From MaRDI portal
Publication:880045
DOI10.1016/j.laa.2007.01.010zbMath1117.05079OpenAlexW2136509335MaRDI QIDQ880045
Yaokun Wu, Iwao Sato, Ai-ping Deng
Publication date: 10 May 2007
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2007.01.010
Algebraic combinatorics (05E99) Eigenvalues, singular values, and eigenvectors (15A18) Directed graphs (digraphs), tournaments (05C20) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (13)
Adjacency polynomials of digraph transformations ⋮ Bartholdi Zeta Functions of Branched Coverings of Digraphs ⋮ Bi-resolving graph homomorphisms and extensions of bi-closing codes ⋮ Characteristic polynomials of ramified uniform covering digraphs ⋮ Characteristic polynomials and zeta functions of equitably partitioned graphs ⋮ Spectra of digraph transformations ⋮ Distance and adjacency spectra and eigenspaces for three (di)graph lifts: a unified approach ⋮ Laplacian spectra of digraph transformations ⋮ Weighted zeta functions for quotients of regular coverings of graphs ⋮ Invariant subspace, determinant and characteristic polynomials ⋮ Infinite families of directed strongly regular graphs using equitable partitions ⋮ The zeta functions of dihypergraphs and dihypergraph coverings ⋮ Ramanujan graphs arising as weighted Galois covering graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Hoffman polynomials of nonnegative irreducible matrices and strongly connected digraphs
- Generating all graph coverings by permutation voltage assignments
- Partitioned tensor products and their spectra
- Symbolic dynamics. One-sided, two-sided and countable state Markov shifts
- A note on a theorem of Horst Sachs
- Classification of subshifts of finite type
- Characteristic polynomials of some graph coverings
- Characteristic polynomials of graphs having a semifree action
- Characteristic polynomials of digraphs having a semi-free action
- Constant-to-one and onto global maps of homomorphisms between strongly connected graphs
- Caracteristics polynomials of some grap bundlesII
- Topological entropy and equivalence of dynamical systems
- Characteristic polynomials of graph coverings
- An Introduction to Symbolic Dynamics and Coding
- Fibrations of graphs
This page was built for publication: Homomorphisms, representations and characteristic polynomials of digraphs