Some inner metric parameters of a digraph: iterated line digraphs and integer sequences
In this paper, we first give a new result characterizing the strongly connected digraphs with a diameter equal to that of their line digraphs. Then we introduce the concepts of the inner diameter and inner radius of a digraph and study their behaviors in its iterated line digraphs. Furthermore, we p...
| Autores: | , , , |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2024 |
| País: | España |
| Institución: | Varias* (Consorci de Biblioteques Universitáries de Catalunya, Centre de Serveis Científics i Acadèmics de Catalunya) |
| Repositorio: | Recercat. Dipósit de la Recerca de Catalunya |
| OAI Identifier: | oai:recercat.cat:10459.1/466996 |
| Acceso en línea: | https://doi.org/10.1007/s40590-024-00691-8 https://hdl.handle.net/10459.1/466996 |
| Access Level: | acceso abierto |
| Palabra clave: | De Bruijn digraph Eccentricity Inner diameter Integer sequence Kautz digraph Line digraph |
| Sumario: | In this paper, we first give a new result characterizing the strongly connected digraphs with a diameter equal to that of their line digraphs. Then we introduce the concepts of the inner diameter and inner radius of a digraph and study their behaviors in its iterated line digraphs. Furthermore, we provide a method to characterize sequences of integers (corresponding to the inner diameter or the number of vertices of a digraph and its iterated line digraphs) that satisfy some conditions. Among other examples, we apply the method to the cyclic Kautz digraphs, square-free digraphs, and the subdigraphs of De Bruijn digraphs. Finally, we present some tables with new sequences that do not belong to The On-Line Encyclopedia of Integer Sequences. |
|---|