The identification of an incompletely partitioned network

DOI10.1090/qam/99915zbMath0171.22501OpenAlexW2567300491MaRDI QIDQ5557757

Paul Slepian, P. V. O'Neil

Publication date: 1966

Published in: Quarterly of Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/qam/99915

zbMATH Keywords

topology

Related Items

The number of spanning trees of the generalized Boolean \(n\)-cube network, A certain polynomial of a graph and graphs with an extremal number of trees, Formulas for the number of trees in certain incomplete graphs, The number of spanning trees of the generalized hypercube network, Enumeration of spanning trees containing given subgraphs, Indirect counting trees in linear graphs, Chebyshev polynomials and spanning tree formulas for circulant and related graphs