A Graph-Theoretic Approach to a Communications Problem
From MaRDI portal
Publication:5522045
DOI10.1137/0114065zbMath0145.20605MaRDI QIDQ5522045
Publication date: 1966
Published in: SIAM Journal on Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0114065
Related Items
On the minimum degree, edge-connectivity and connectivity of power graphs of finite groups, Realizability ofp-point,q-line graphs with prescribed maximum degree and line connectivity or minimum degree, Inverse degree and super edge-connectivity, Sufficient conditions for optimally and super m-restricted edge-connected graphs with given girth, Unnamed Item, Super Edge-Connected Linear Hypergraphs, Parameterized Algorithms for Partitioning Graphs into Highly Connected Clusters, On the edge-connectivity of C_4-free graphs, Maximally edge-connected graphs and zeroth-order general Randić index for \(\alpha\leq-1\), Maximally edge-connected hypergraphs, Super \(\lambda_3\)-optimality of regular graphs, Relations between parameters of a graph, Degree conditions for restricted-edge-connectivity and isoperimetric-edge-connectivity to be optimal, Maximally edge-connected and vertex-connected graphs and digraphs: A survey, On super edge-connectivity of product graphs, Inverse degree and edge-connectivity, The connected cutset connectivity of a graph, On graphs with equal edge connectivity and minimum degree, On graphs with equal edge-connectivity and minimum degree, How to find overfull subgraphs in graphs with large maximum degree, On the order and size of \(s\)-geodetic digraphs with given connectivity, Results on the edge-connectivity of graphs, Super edge-connectivity and zeroth-order general Randić index for \(-1 \leq \alpha < 0\), Sufficient conditions for maximally edge-connected and super-edge-connected graphs depending on the clique number, Multivariate algorithmics for finding cohesive subnetworks, Codes from incidence matrices of graphs, Designs with blocks of size two and applications to microarray experiments, Edge-connectivity in hypergraphs, Degree sequence conditions for maximally edge-connected and super edge-connected hypergraphs, Super edge-connectivity and zeroth-order Randić index, Edge-fault-tolerant strong Menger edge connectivity on regular graphs, Super-edge-connectivity and zeroth-order Randić index, Sufficient conditions for maximally edge-connected and super-edge-connected digraphs depending on the size, Star complements and edge-connectivity in finite graphs, Maximally edge-connected graphs and zeroth-order general Randić index for \(0<\alpha <1\), Sufficient conditions for restricted-edge-connectivity to be optimal, On the edge-connectivity and restricted edge-connectivity of a product of graphs, Local-edge-connectivity in digraphs and oriented graphs, Parameterized Algorithmics for Graph Modification Problems: On Interactions with Heuristics, A generalization of an edge-connectivity theorem of Chartrand, Sufficient degree conditions fork-edge-connectedness of a graph, On Minimum Critically n-Edge-Connected Graphs, Graphs and degree sequences. I
