Sufficient conditions for optimally and super m-restricted edge-connected graphs with given girth
From MaRDI portal
Publication:5069204
DOI10.1080/03081087.2020.1754749zbMath1486.05246OpenAlexW3017418799MaRDI QIDQ5069204
Jianping Ou, Chen Ouyang, Saihua Liu
Publication date: 8 April 2022
Published in: Linear and Multilinear Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/03081087.2020.1754749
Applications of graph theory (05C90) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sufficient conditions for \(k\)-restricted edge connected graphs
- \(k\)-restricted edge-connectivity in triangle-free graphs
- \(k\)-restricted edge connectivity in \((p+1)\)-clique-free graphs
- A general sufficient condition for a graph \(G\) with \(\lambda _{m }(G) \leqslant \zeta _{m }(G)\)
- Degree conditions for graphs to be \(\lambda_3\)-optimal and super-\(\lambda _3\)
- Sufficient conditions for maximally connected dense graphs
- On computing a conditional edge-connectivity of a graph
- On graphs with equal edge connectivity and minimum degree
- On graphs with equal edge-connectivity and minimum degree
- Results on the edge-connectivity of graphs
- The \(k\)-restricted edge-connectivity of a product of graphs
- Edge-cuts leaving components of order at least three
- Conditional edge connectivity properties, reliability comparisons and transitivity of graphs
- Optimally super-edge-connected transitive graphs
- On the extraconnectivity of graphs
- A sufficient condition for graphs to be super \(k\)-restricted edge connected
- A bound on 4-restricted edge connectivity of graphs
- Sufficient conditions for restricted-edge-connectivity to be optimal
- A proof of an inequality concerning \(k\)-restricted edge connectivity
- Edge cuts leaving components of order at least \(m\)
- On maximal 3-restricted edge connectivity of regular graphs
- Maximally connected digraphs
- Super edge connectivity properties of connected edge symmetric graphs
- Sufficient conditions for graphs to be ??-optimal, super-edge-connected, and maximally edge-connected
- A Graph-Theoretic Approach to a Communications Problem
- On restricted edge-connectivity of graphs.
This page was built for publication: Sufficient conditions for optimally and super m-restricted edge-connected graphs with given girth
