Expanding and forwarding

DOI10.1016/0166-218X(93)E0118-IMaRDI QIDQ1805464zbMATH OpenFDO

Authors Patrick Solé

Publication date 11 September 1995

Published in Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

diametereigenvalueLaplacianspectrumeccentricitygenustight boundsroutingsforwarding parametersvertex forwarding indices

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Extremal problems in graph theory (05C35) Distance in graphs (05C12) Paths and cycles (05C38) Connectivity (05C40)

Recommendations

• Expanding and forwarding parameters of product graphs
• The forwarding diameter of graphs
• On forwarding indices of networks
• The forwarding index of communication networks
• Two remarks on ``Expanding and forwarding by P. Solé

Cites work

• scientific article; zbMATH DE number 3904630 (Why is no real title available?)
• scientific article; zbMATH DE number 3717357 (Why is no real title available?)
• scientific article; zbMATH DE number 43547 (Why is no real title available?)
• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• scientific article; zbMATH DE number 3799566 (Why is no real title available?)
• scientific article; zbMATH DE number 867649 (Why is no real title available?)
• scientific article; zbMATH DE number 3318548 (Why is no real title available?)
• A separator theorem for graphs of bounded genus
• Approximate counting, uniform generation and rapidly mixing Markov chains
• Approximating the Permanent
• Eigenvalues and expanders
• Graph theory
• Isoperimetric numbers of graphs
• More odd graph theory
• On forwarding indices of networks
• On the covering radius of cyclic linear codes and arithmetic codes
• The covering radius of doubled 2-designs in \(2O_ k\)
• The forwarding index of communication networks
• \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators

Cited in

(25)

• Low-congested interval routing schemes for hypercubelike networks
• Forwarding and optical indices of a graph
• Bounds for the Laplacian spectral radius of graphs
• The Laplacian spectral radius of a graph under perturbation
• Efficient collective communciation in optical networks
• The Laplacian spectral radius for unicyclic graphs with given independence number
• The algebraic connectivity of graphs with given circumference
• On conjectures involving second largest signless Laplacian eigenvalue of graphs
• Two remarks on ``Expanding and forwarding by P. Solé
• Expanding and forwarding parameters of product graphs
• On \(f\)-fault tolerant arc-forwarding and optical indices of all-optical folded hypercubes
• The smallest Laplacian spectral radius of graphs with a given clique number
• On the design of efficient ATM routing schemes
• Grid spanners with low forwarding index for energy efficient networks
• Expanding factors of graphs
• Spectral bounds for the betweenness of a graph
• On graphs whose Laplacian index does not exceed 4.5
• Directed virtual path layouts in ATM networks
• Automated conjectures on upper bounds for the largest Laplacian eigenvalue of graphs
• The undirected optical indices of complete \(m\)-ary trees
• A survey of automated conjectures in spectral graph theory
• Static and dynamic low-congested interval routing schemes
• Metaheuristics for computing the forwarding index of a graph*
• Graph realizations associated with minimizing the maximum eigenvalue of the Laplacian
• On the dual distance and the gap of a binary code

This page was built for publication: Expanding and forwarding

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1805464)