An Inequality for Walks in a Graph
J. C. Lagarias, J. E. Mazo, L. A. Shepp, B. McKay · SIAM Review · 1984
Previous article Next article An Inequality for Walks in a GraphJ. C. Lagarias, J. E. Mazo, L. A. Shepp, and B. McKayJ. C. Lagarias, J. E. Mazo, L. A. Shepp, and B. McKayhttps://doi.org/10.1137/1026112PDFBibTexSections ToolsAdd to favoritesExport CitationTrack CitationsEmail SectionsAbout Previous article Next article FiguresRelatedReferencesCited byDetails A path forward: Tropicalization in extremal combinatoricsAdvances in Mathematics, Vol. 407 Cross Ref The Extended Directed Friendship ParadoxSSRN Electronic Journal Cross Ref Matrix power inequalities and the number of walks in graphsDiscrete Applied Mathematics, Vol. 176 Cross Ref Inequalities for the Number of Walks in Graphs16 March 2013 | Algorithmica, Vol. 66, No. 4 Cross Ref Volume 26, Issue 4| 1984SIAM Review History Published online:10 July 2006 InformationCopyright © 1984 Society for Industrial and Applied MathematicsPDF Download Article & Publication DataArticle DOI:10.1137/1026112Article page range:pp. 580-582ISSN (print):0036-1445ISSN (online):1095-7200Publisher:Society for Industrial and Applied Mathematics