Expanding and forwarding

DOI10.1016/0166-218X(93)E0118-IzbMath0820.05034MaRDI QIDQ1805464

Patrick Solé

Publication date: 11 September 1995

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

zbMATH Keywords

eigenvaluespectrumdiameterLaplacianeccentricitygenustight boundsroutingsforwarding parametersvertex forwarding indices

Mathematics Subject Classification ID

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

Related Items (24)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
• On the covering radius of cyclic linear codes and arithmetic codes
• Eigenvalues and expanders
• Approximate counting, uniform generation and rapidly mixing Markov chains
• More odd graph theory
• On forwarding indices of networks
• Isoperimetric numbers of graphs
• The forwarding index of communication networks
• Approximating the Permanent
• A separator theorem for graphs of bounded genus
• The covering radius of doubled 2-designs in \(2O_ k\)

This page was built for publication: Expanding and forwarding