On a problem of walks
Charles Delorme; Marie-Claude Heydemann
Annales de l'institut Fourier (1999)
- Volume: 49, Issue: 3, page 905-919
- ISSN: 0373-0956
Access Full Article
topAbstract
topHow to cite
topDelorme, Charles, and Heydemann, Marie-Claude. "On a problem of walks." Annales de l'institut Fourier 49.3 (1999): 905-919. <http://eudml.org/doc/75369>.
@article{Delorme1999,
abstract = {In 1995, F. Jaeger and M.-C. Heydemann began to work on a conjecture on binary operations which are related to homomorphisms of De Bruijn digraphs. For this, they have considered the class of digraphs $G$ such that for any integer $k$, $G$ has exactly $n$ walks of length $k$, where $n$ is the order of $G$. Recently, C. Delorme has obtained some results on the original conjecture. The aim of this paper is to recall the conjecture and to report where all the authors arrived.},
author = {Delorme, Charles, Heydemann, Marie-Claude},
journal = {Annales de l'institut Fourier},
keywords = {semigroups; walks; iterated line digraphs},
language = {eng},
number = {3},
pages = {905-919},
publisher = {Association des Annales de l'Institut Fourier},
title = {On a problem of walks},
url = {http://eudml.org/doc/75369},
volume = {49},
year = {1999},
}
TY - JOUR
AU - Delorme, Charles
AU - Heydemann, Marie-Claude
TI - On a problem of walks
JO - Annales de l'institut Fourier
PY - 1999
PB - Association des Annales de l'Institut Fourier
VL - 49
IS - 3
SP - 905
EP - 919
AB - In 1995, F. Jaeger and M.-C. Heydemann began to work on a conjecture on binary operations which are related to homomorphisms of De Bruijn digraphs. For this, they have considered the class of digraphs $G$ such that for any integer $k$, $G$ has exactly $n$ walks of length $k$, where $n$ is the order of $G$. Recently, C. Delorme has obtained some results on the original conjecture. The aim of this paper is to recall the conjecture and to report where all the authors arrived.
LA - eng
KW - semigroups; walks; iterated line digraphs
UR - http://eudml.org/doc/75369
ER -
References
top- [1] L. W. BEINEKE, On derived graphs and digraphs, in Beiträge zur Graphentheorie (ed. Sachs et al.), Teubner-Verlag, Leipzig (1968), 17-23. Zbl0179.29204
- [2] C. BERGE, Graphes et Hypergraphes, Dunod, Paris, 1973. Zbl0332.05101MR50 #9639
- [3] M. A. FIOL, J. L. A. YEBRA, and I. ALEGRE, Line digraph iterations and the (d, k) digraph problem, IEEE Transactions on Computers, C-33(5) (1984), 400-403. Zbl0528.68048
- [4] C. D. GODSIL, Algebraic combinatorics, Chapman and Hall, New-York, 1993. Zbl0784.05001MR94e:05002
- [5] F. HARARY and R. Z. NORMAN, Some properties of line digraphs, Rend. Circ. Mat. Palermo, (2) 9 (1960), 161-168. Zbl0099.18205MR24 #A693
- [6] R. L. HEMMINGER, Digraphs with periodic line digraphs, Studia Sci. Math. Hungar., 9 (1974), 27-31. Zbl0304.05112MR52 #2948
- [7] R. L. HEMMINGER and L. W. BEINEKE, Line graphs and line digraphs, in Selected topics in graph theory I (1983), 270-304. Zbl0434.05056
- [8] H. MINC, Nonnegative matrices, J. Wiley and Sons (New York), Wiley-interscience series in discrete mathematics and optimization, 1988. Zbl0638.15008MR89i:15001
- [9] P. TVRDÍK, R. HARBANE, M.-C. HEYDEMANN, Uniform Homomorphisms and Divide & Conquer Emulations on de Bruijn and Kautz Networks, Discrete Appl. Math., 83 (1998), 279-301. Zbl0902.68078MR99d:68025
- [10] H. S. WILF, Generatingfunctionology, Academic Press, New York, 1990. Zbl0689.05001MR91g:05008
NotesEmbed ?
topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.