Downloads provided by UsageCounts
handle: 2117/105171
In this note we present a general approach to construct large digraphs from small ones. These are called expanded digraphs, and, as particular cases, we show their close relationship between voltage digraphs and line digraphs, which are two known approaches to obtain dense digraphs. In the same context, we show the equivalence between the vertex-splitting and partial line digraph techniques. Then, we give a sufficient condition for a lifted digraph of a base line digraph to be again a line digraph. Some of the results are illustrated with two well-known families of digraphs. Namely, De Bruijn and Kautz digraphs.
Àrees temàtiques de la UPC::Matemàtiques i estadística::Matemàtica discreta, Matrices, Matrius (Matemàtica), :Matemàtiques i estadística::Matemàtica discreta [Àrees temàtiques de la UPC], Directed graphs, Grafs dirigits
Àrees temàtiques de la UPC::Matemàtiques i estadística::Matemàtica discreta, Matrices, Matrius (Matemàtica), :Matemàtiques i estadística::Matemàtica discreta [Àrees temàtiques de la UPC], Directed graphs, Grafs dirigits
| 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). | 0 | |
| 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 | 43 | |
| downloads | 80 |

Views provided by UsageCounts
Downloads provided by UsageCounts