Permutation Inequalities for Walks in Graphs
From MaRDI portal
Abstract: Using spectral graph theory, we show how to obtain inequalities for the number of walks in graphs from nonnegative polynomials and present a new family of such inequalities.
This page was built for publication: Permutation Inequalities for Walks in Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6430901)
