Transportation in graphs and the admittance spectrum

DOI10.1016/0166-218X(87)90052-7zbMath0612.90038OpenAlexW2104925992MaRDI QIDQ1088578

Christoph Maas

Publication date: 1987

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

Full work available at URL: https://doi.org/10.1016/0166-218x(87)90052-7

zbMATH Keywords

permeabilityliquidadmittance spectrumcommunicating pipes

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Related Items

Heat conduction on graphs ⋮ Geometric Approaches to the Estimation of the Spectral Gap of Reversible Markov Chains ⋮ Old and new results on algebraic connectivity of graphs ⋮ Algorithms for synthesizing mechanical systems with maximal natural frequencies ⋮ Network-complement transitions, symmetries, and cluster synchronization ⋮ Inverse source problem in a forced network ⋮ Eigenvalues, diameter, and mean distance in graphs ⋮ Finite element mesh decomposition using complementary Laplacian matrix ⋮ A survey of automated conjectures in spectral graph theory ⋮ The number of spanning forests of a graph ⋮ Asymptotic spectra of large (grid) graphs with a uniform local structure. I: Theory ⋮ Combinatorial optimization of special graphs for nodal ordering and graph partitioning ⋮ Maximum algebraic connectivity augmentation is NP-hard ⋮ Localized solutions of nonlinear network wave equations ⋮ Laplacian matrices of graphs: A survey

Cites Work

• Computing and interpreting the adjacency spectrum of traffic networks
• Methods of intermediate problems for eigenvalues. Theory and ramifications
• Unnamed Item
• Unnamed Item
• Unnamed Item