Optimal linear labelings and eigenvalues of graphs
- 30 April 1992
- journal article
- research article
- Published by Elsevier BV in Discrete Applied Mathematics
- Vol. 36 (2), 153-168
- https://doi.org/10.1016/0166-218x(92)90229-4
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- λ1, Isoperimetric inequalities for graphs, and superconcentratorsJournal of Combinatorial Theory, Series B, 1985
- On optimal linear arrangements of treesComputers & Mathematics with Applications, 1984
- The bandwidth problem for graphs and matrices—a surveyJournal of Graph Theory, 1982
- Dynamic-Programming Algorithms for Recognizing Small-Bandwidth Graphs in Polynomial TimeSIAM Journal on Algebraic Discrete Methods, 1980
- A Conjectured Minimum Valuation Tree (I. Cahit)SIAM Review, 1978
- Complexity Results for Bandwidth MinimizationSIAM Journal on Applied Mathematics, 1978
- The NP-Completeness of the bandwidth minimization problemComputing, 1976
- Optimal labelling of a product of two pathsDiscrete Mathematics, 1975
- A property of eigenvectors of nonnegative symmetric matrices and its application to graph theoryCzechoslovak Mathematical Journal, 1975
- Some simplified NP-complete problemsPublished by Association for Computing Machinery (ACM) ,1974