On restricted edge-connectivity of replacement product graphs
From MaRDI portal
(Redirected from Publication:1708063)
Abstract: This paper considers the edge-connectivity and restricted edge-connectivity of replacement product graphs, gives some bounds on edge-connectivity and restricted edge-connectivity of replacement product graphs and determines the exact values for some special graphs. In particular, the authors further confirm that under certain conditions, the replacement product of two Cayley graphs is also a Cayley graph, and give a necessary and sufficient condition for such Cayley graphs to have maximum restricted edge-connectivity. Based on these results, the authors construct a Cayley graph with degree whose restricted edge-connectivity is equal to for given odd integer and integer with and , which answers a problem proposed ten years ago.
Recommendations
- On the edge-connectivity and restricted edge-connectivity of a product of graphs
- The \(k\)-restricted edge-connectivity of a product of graphs
- On restricted edge-connectivity of graphs.
- On restricted edge connectivity of strong product graphs.
- On restricted edge connectivity of regular Cartesian product graphs
Cites work
- scientific article; zbMATH DE number 1332751 (Why is no real title available?)
- scientific article; zbMATH DE number 1156597 (Why is no real title available?)
- scientific article; zbMATH DE number 2010366 (Why is no real title available?)
- scientific article; zbMATH DE number 1506502 (Why is no real title available?)
- scientific article; zbMATH DE number 2151843 (Why is no real title available?)
- scientific article; zbMATH DE number 6315655 (Why is no real title available?)
- scientific article; zbMATH DE number 2197917 (Why is no real title available?)
- scientific article; zbMATH DE number 7696362 (Why is no real title available?)
- An introduction to abstract algebra
- Automorphism groups of Cayley graphs generated by connected transposition sets
- Automorphism groups of Cayley graphs on symmetric groups with generating transposition sets
- Conditional edge connectivity properties, reliability comparisons and transitivity of graphs
- Conditional fault diagnosability of dual-cubes
- Entropy waves, the zig-zag graph product, and new constant-degree expanders
- Expander graphs and their applications
- Filling Riemannian manifolds
- Inflated graphs with equal independence number and upper irredundance number
- Irredundance in inflated graphs
- On a kind of restricted edge connectivity of graphs
- On computing a conditional edge-connectivity of a graph
- On restricted edge-connectivity of graphs.
- Optimally super-edge-connected transitive graphs
- Paired-domination in inflated graphs
- Some results on the lexicographic product of vertex-transitive graphs
- Sufficient conditions for '-optimality in graphs of diameter 2
- Sufficient conditions for graphs to be ??-optimal, super-edge-connected, and maximally edge-connected
- Super edge connectivity properties of connected edge symmetric graphs
- Super restricted edge connectivity of regular graphs
- Super-edge-connectivity properties of graphs with diameter 2
- The automorphism group of the alternating group graph
- Theory and Application of Graphs
- Zig-zag and replacement product graphs and LDPC codes
Cited in
(2)
This page was built for publication: On restricted edge-connectivity of replacement product graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1708063)
