On restricted edge-connectivity of replacement product graphs
From MaRDI portal
Publication:1708063
DOI10.1007/S11425-015-0862-0zbMATH Open1383.05181arXiv1512.08344OpenAlexW2963182581MaRDI QIDQ1708063FDOQ1708063
Authors: Jun-Ming Xu, Zhen-Mu Hong 
Publication date: 4 April 2018
Published in: Science China. Mathematics (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1512.08344
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
Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Connectivity (05C40) Graph operations (line graphs, products, etc.) (05C76)
Cites Work
- An introduction to abstract algebra
- Entropy waves, the zig-zag graph product, and new constant-degree expanders
- Filling Riemannian manifolds
- Conditional fault diagnosability of dual-cubes
- Expander graphs and their applications
- Title not available (Why is that?)
- Theory and Application of Graphs
- On computing a conditional edge-connectivity of a graph
- Optimally super-edge-connected transitive graphs
- On a kind of restricted edge connectivity of graphs
- Sufficient conditions for \(\lambda'\)-optimality in graphs of diameter 2
- Conditional edge connectivity properties, reliability comparisons and transitivity of graphs
- Some results on the lexicographic product of vertex-transitive graphs
- Automorphism groups of Cayley graphs on symmetric groups with generating transposition sets
- Automorphism groups of Cayley graphs generated by connected transposition sets
- Irredundance in inflated graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Sufficient conditions for graphs to be ??-optimal, super-edge-connected, and maximally edge-connected
- On restricted edge-connectivity of graphs.
- Super restricted edge connectivity of regular graphs
- Super edge connectivity properties of connected edge symmetric graphs
- The automorphism group of the alternating group graph
- Title not available (Why is that?)
- Inflated graphs with equal independence number and upper irredundance number
- Title not available (Why is that?)
- Title not available (Why is that?)
- Paired-domination in inflated graphs
- Super-edge-connectivity properties of graphs with diameter 2
- Title not available (Why is that?)
- Zig-zag and replacement product graphs and LDPC codes
- Title not available (Why is that?)
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)
