Cospectral digraphs from locally line digraphs
From MaRDI portal
Abstract: A digraph is a line digraph when every pair of vertices have either equal or disjoint in-neighborhoods. When this condition only applies for vertices in a given subset (with at least two elements), we say that is a locally line digraph. In this paper we give a new method to obtain a digraph cospectral with a given locally line digraph with diameter , where the diameter of is in the interval . In particular, when the method is applied to De Bruijn or Kautz digraphs, we obtain cospectral digraphs with the same algebraic properties that characterize the formers.
Recommendations
Cites work
- scientific article; zbMATH DE number 3910417 (Why is no real title available?)
- scientific article; zbMATH DE number 1055145 (Why is no real title available?)
- scientific article; zbMATH DE number 3218572 (Why is no real title available?)
- An application of matrix theory to a problem in universal algebra
- Constructing cospectral graphs
- Graph theory
- Line Digraph Iterations and the (d, k) Digraph Problem
- Message Graphs
- The Polynomial of a Directed Graph
- The spectra of some families of digraphs
Cited in
(4)
This page was built for publication: Cospectral digraphs from locally line digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q272341)