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