Sufficient conditions for '-optimality in graphs of diameter 2
From MaRDI portal
Publication:1827779
Recommendations
- Sufficient conditions for λ′‐optimality in graphs with girth g
- A sufficient condition for graphs to be \(\lambda_k\)-optimal
- Sufficient conditions for graphs to be λ′‐optimal and super‐λ′
- Sufficient conditions for graphs to be \({\lambda^\prime}\)-optimal
- Sufficient conditions for graphs to be ??-optimal, super-edge-connected, and maximally edge-connected
Cites work
- scientific article; zbMATH DE number 3497930 (Why is no real title available?)
- scientific article; zbMATH DE number 1332751 (Why is no real title available?)
- scientific article; zbMATH DE number 1055145 (Why is no real title available?)
- scientific article; zbMATH DE number 2197917 (Why is no real title available?)
- Fault tolerance measures for m-ary n-dimensional hypercubes based on forbidden faulty sets
- On computing a conditional edge-connectivity of a graph
- On restricted edge-connectivity of graphs.
- On super-edge-connected digraphs and bipartite digraphs
- On the superconnectivity of generalized \(p\)-cycles
- Sufficient conditions for graphs to be ??-optimal, super-edge-connected, and maximally edge-connected
- Super-edge-connectivity properties of graphs with diameter 2
Cited in
(34)- Codes from incidence matrices of graphs
- On the restricted connectivity and superconnectivity in graphs with given girth
- Sufficient conditions for \(\lambda _k\)-optimality in triangle-free graphs
- Sufficient conditions for \(\lambda ^{\prime}\)-optimality of graphs with small conditional diameter
- \(\lambda ^{\prime}\)-optimally connected mixed Cayley graphs
- \(\lambda ^{\prime}\)-optimal digraphs
- Degree conditions for graphs to be \(\lambda_3\)-optimal and super-\(\lambda _3\)
- Sufficient conditions for λ′‐optimality in graphs with girth g
- The restricted arc connectivity of Cartesian product digraphs
- A neighborhood condition for graphs to be maximally \(k\)-restricted edge connected
- A sufficient condition for the equality between the restricted edge-connectivity and the minimum edge-degree of graphs
- On optimizing edge connectivity of product graphs
- Sufficient conditions for triangle-free graphs to be super-\(\lambda'\)
- Sufficient conditions for graphs to be λ′‐optimal and super‐λ′
- Super connectivity of line graphs
- Matching cutsets in graphs of diameter 2
- Sufficient conditions for graphs to be \({\lambda^\prime}\)-optimal
- Diameter-sufficient conditions for a graph to be super-restricted connected
- Optimization problems of the third edge-connectivity of graphs
- Diameter-girth sufficient conditions for optimal extraconnectivity in graphs
- \(k\)-restricted edge connectivity in \((p+1)\)-clique-free graphs
- On restricted edge-connectivity of replacement product graphs
- On the connectivity and restricted edge-connectivity of 3-arc graphs
- Fault-tolerant analysis of a class of networks
- On reliability of the folded hypercubes
- Sufficient conditions for super \(k\)-restricted edge connectivity in graphs of diameter 2
- Maximally edge-connected and vertex-connected graphs and digraphs: A survey
- scientific article; zbMATH DE number 6672459 (Why is no real title available?)
- A sufficient condition for graphs to be \(\lambda_k\)-optimal
- On the \(\lambda ^{\prime}\)-optimality in graphs with odd girth \(g\) and even girth \(h\)
- On 3-restricted edge connectivity of undirected binary Kautz graphs
- Sufficient conditions for \(k\)-restricted edge connected graphs
- \(\lambda^{\prime}\)-optimality of bipartite digraphs
- Restricted arc-connectivity of digraphs
This page was built for publication: Sufficient conditions for \(\lambda'\)-optimality in graphs of diameter 2
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1827779)
