A Graph-Theoretic Approach to a Communications Problem

Cited in

(49)

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 for k-edge-connectedness of a graph
On Minimum Critically n-Edge-Connected Graphs
Graphs and degree sequences. I
Realizability ofp-point,q-line graphs with prescribed maximum degree and line connectivity or minimum degree
On the minimum degree, edge-connectivity and connectivity of power graphs of finite groups
Inverse degree and super edge-connectivity
Maximally edge-connected hypergraphs
Sufficient conditions for optimally and super m-restricted edge-connected graphs with given girth
Super Edge-Connected Linear Hypergraphs
Parameterized Algorithms for Partitioning Graphs into Highly Connected Clusters
scientific article; zbMATH DE number 7090175 (Why is no real title available?)
On the edge-connectivity of C₄-free graphs
Maximally edge-connected graphs and zeroth-order general Randić index for -1
Super \(\lambda_3\)-optimality of regular graphs
Construction of linear codes from the unit graph \(G(\mathbb{Z}_n)\)
Characterizing the forbidden pairs for graphs to be super-edge-connected
On the edge-connectivity of the square of a graph
On the size of linear r-uniform hypergraphs and sufficient conditions for maximally edge-connected hypergraphs
On maximally edge-connectivity of squares of graphs
On the maximal edge-connectedness of the third power graph
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

This page was built for publication: A Graph-Theoretic Approach to a Communications Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5522045)