Downloads provided by UsageCounts
arXiv: 1604.04448
handle: 10459.1/72568 , 2117/89900
A digraph $\G=(V,E)$ is a line digraph when every pair of vertices $u,v\in V$ 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 $\G$ is a locally line digraph. In this paper we give a new method to obtain a digraph $\G'$ cospectral with a given locally line digraph $\G$ with diameter $D$, where the diameter $D'$ of $\G'$ is in the interval $[D-1,D+1]$. 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.
adjacency matrix, Graph operations (line graphs, products, etc.), 05C20, 05C50, Directed graphs (digraphs), tournaments, Classificació AMS::05 Combinatorics::05C Graph theory, cospectral digraph, digraph, spectrum, Grafs, Diameter, Spectrum, FOS: Mathematics, Kautz digraph, Mathematics - Combinatorics, diameter, de Bruijn digraph, Àrees temàtiques de la UPC::Matemàtiques i estadística, Teoria de, Graphs and linear algebra (matrices, eigenvalues, etc.), Grafs, Teoria de, Adjacency matrix, Digraph, :Matemàtiques i estadística [Àrees temàtiques de la UPC], Teoria espectral (Matemàtica), Cospectral digraph, De Bruijn digraph, Combinatorics (math.CO), Spectral theory (Mathematics), :05 Combinatorics::05C Graph theory [Classificació AMS], Directed graphs
adjacency matrix, Graph operations (line graphs, products, etc.), 05C20, 05C50, Directed graphs (digraphs), tournaments, Classificació AMS::05 Combinatorics::05C Graph theory, cospectral digraph, digraph, spectrum, Grafs, Diameter, Spectrum, FOS: Mathematics, Kautz digraph, Mathematics - Combinatorics, diameter, de Bruijn digraph, Àrees temàtiques de la UPC::Matemàtiques i estadística, Teoria de, Graphs and linear algebra (matrices, eigenvalues, etc.), Grafs, Teoria de, Adjacency matrix, Digraph, :Matemàtiques i estadística [Àrees temàtiques de la UPC], Teoria espectral (Matemàtica), Cospectral digraph, De Bruijn digraph, Combinatorics (math.CO), Spectral theory (Mathematics), :05 Combinatorics::05C Graph theory [Classificació AMS], Directed graphs
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 4 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
| views | 64 | |
| downloads | 55 |

Views provided by UsageCounts
Downloads provided by UsageCounts