See this document in CiteSeerX!

Mean Eccentricities of de Bruijn Networks (1993)  (Make Corrections)  (2 citations)
Jean-Claude Bermond I3S, CNRS-Universit'e de Nice-Sophia Antipolis Bat 4, 250 ...
NETWORKS: Networks: An International Journal



  Home/Search   Context   Related

 
View or download:
sop.inria.fr/mascotte/person...BLS97.ps
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  sop.inria.fr/mascott...BERMONDJC (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: Given a graph G = (V; E) we define e(X), the mean eccentricity of a vertex X , as the average distance from X to all the other vertices of the graph. The computation of this parameter appears to be nontrivial in the case of the de Bruijn networks. In this paper we consider upper and lower bounds for e(X). For the directed de Bruijn network, we provide tight bounds as well as the extremal vertices which reach these bounds. These bounds are expressed as the diameter minus some constants. In the ... (Update)

Similar documents based on text:   More   All
0.8:   Mean Eccentricities of de Bruijn Networks - Bermond, Liu (1993)   (Correct)
0.2:   From Honest to Intelligent Plotting - Avitzur, Bachmann, Kajler (1995)   (Correct)
0.2:   Lower Bounds on the Broadcasting and Gossiping Time.. - Flammini.. (1999)   (Correct)

BibTeX entry:   (Update)

J.C. Bermond, Z. Liu and M. Syska, "Mean eccentricities of de Bruijn networks," Rapport de Recherche INRIA, no. 2114, 1993. http://citeseer.ist.psu.edu/bermond93mean.html   More

@article{ bermond97mean,
    author = "Bermond and Liu and Syska",
    title = "Mean Eccentricities of de Bruijn Networks",
    journal = "NETWORKS: Networks: An International Journal",
    volume = "30",
    year = "1997",
    url = "citeseer.ist.psu.edu/bermond93mean.html" }
Citations (may not include all citations):
981   Introduction to Parallel Algorithms and Architectures : Arra.. (context) - Leighton - 1991
170   Shift Register Sequences (context) - Golomb - 1967
73   Distance in Graphs (context) - Buckley, Harary - 1990
41   Strategies for interconnection networks: Some methods from g.. (context) - Bermond, Delorme et al. - 1986
40   A combinatorial problem (context) - de Bruijn - 1946
38   de Bruijn multiprocessor network: a versatile parallel proce.. (context) - Samatham, Pradhan - 1989
29   De Bruijn and Kautz networks: a competitor for the hypercube (context) - Bermond, Peyrat - 1989
14   Large fault-tolerant interconnection networks (context) - Bermond, Homobono et al. - 1989
10   Optimal Routing in the De Bruijn Networks (context) - Liu - 1990
5   Vuln'erabilit'e dans les grand r'eseaux d'interconnexion (context) - Peyrat - 1984
4   Line Digraph Iterations and the (d,k) Digraph Problem (context) - Fiol, Yebra et al. - 1984
4   The radius of graphs on alphabets (context) - Bermond, Bond et al. - 1988
4   Constructions de grands r'eseaux d'interconnexion (context) - Bond - 1984

Documents on the same site (http://www-sop.inria.fr/mascotte/personnel/Jean-Claude.Bermond/Biblio/Author/BERMOND-JC.html):   More
Gossiping in Cayley Graphs by Packets - Bermond, Kodate, Perennes (1995)   (Correct)
Acyclic Orientations for Deadlock Prevention in Usual.. - Bermond, Di Ianni.. (1996)   (Correct)
De Bruijn and Kautz Bus Networks Jean-Claude Bermond - Cnrs Universit'e De   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC