Super _3-optimality of regular graphs
From MaRDI portal
Publication:659824
DOI10.1016/J.AML.2011.07.018zbMATH Open1242.05145OpenAlexW2062163585MaRDI QIDQ659824FDOQ659824
Authors: Litao Guo, Xiaofeng Guo, Rui-fang Liu 
Publication date: 24 January 2012
Published in: Applied Mathematics Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.aml.2011.07.018
Recommendations
- Degree conditions for graphs to be \(\lambda_3\)-optimal and super-\(\lambda _3\)
- Sufficient conditions for graphs to be λ′‐optimal and super‐λ′
- Sufficient conditions for \(\lambda_k\)-optimality and super-\(\lambda_k\) in graphs
- On 3-edge-connected supereulerian graphs
- Sufficient conditions for graphs to be ??-optimal, super-edge-connected, and maximally edge-connected
- On optimally-\(\lambda^{(3)}\) transitive graphs
- scientific article; zbMATH DE number 1854059
- The superregular graphs
- On 3-edge-connected supereulerian graphs in graph family \(C(l,k)\)
- scientific article; zbMATH DE number 2094794
Graph theory (including graph drawing) in computer science (68R10) Connectivity (05C40) Network design and communication in computer systems (68M10)
Cites Work
- Graph theory
- Title not available (Why is that?)
- On the extraconnectivity of graphs
- Title not available (Why is that?)
- On computing a conditional edge-connectivity of a graph
- Longest fault-free paths in hypercubes with vertex faults
- Optimally super-edge-connected transitive graphs
- On a kind of restricted edge connectivity of graphs
- Conditional edge connectivity properties, reliability comparisons and transitivity of graphs
- Edge cuts leaving components of order at least \(m\)
- Sufficient conditions for a graph to be super restricted edge-connected
- On reliability of the folded hypercubes
- Über den Zusammenhang symmetrischer Graphen
- Conditional matching preclusion sets
- Degree conditions for restricted-edge-connectivity and isoperimetric-edge-connectivity to be optimal
- Asymptotic Formulas for the Probability of k-Connectedness of Random Graphs
- Substar reliability analysis in star networks
- A Graph-Theoretic Approach to a Communications Problem
- On the connectivity of clusters
- Sufficient conditions for graphs to be super restricted edge connected
- Sufficient conditions for \(\lambda_3\)-optimality of triangle-free graphs
- Strong connectivity in symmetric graphs and generation of maximal minimally strongly connected subgraphs
Cited In (8)
- Edge fault tolerance of regular graphs on super 3-restricted edge connectivity.
- Title not available (Why is that?)
- Optimization problems of the third edge-connectivity of graphs
- Finding a \(\Delta\)-regular supergraph of minimum order
- On a kind of restricted edge connectivity of graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Degree conditions for graphs to be \(\lambda_3\)-optimal and super-\(\lambda _3\)
Uses Software
This page was built for publication: Super \(\lambda_3\)-optimality of regular graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q659824)
