Sufficient conditions for a graph to be λ k -optimal with given girth and diameter (Q3057138): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1002/net.20322
@@ Property / full work available at URL: https://doi.org/10.1002/net.20322 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W4236188520
@@ Property / OpenAlex ID: W4236188520 / rank @@
+Normal rank
@@ Property / cites work @@
+Extraconnectivity of graphs with large minimum degree and girth
+Normal rank
@@ Property / cites work @@
+Sufficient conditions for \(\lambda ^{\prime}\)-optimality of graphs with small conditional diameter
+Normal rank
@@ Property / cites work @@
+Diameter-girth sufficient conditions for optimal extraconnectivity in graphs
+Normal rank
@@ Property / cites work @@
+Sufficient conditions for λ′‐optimality in graphs with girth <i>g</i>
+Normal rank
@@ Property / cites work @@
+Q3097395
@@ Property / cites work: Q3097395 / rank @@
+Normal rank
@@ Property / cites work @@
+Edge-cuts leaving components of order at least three
+Normal rank
@@ Property / cites work @@
+On computing a conditional edge-connectivity of a graph
+Normal rank
@@ Property / cites work @@
+Extraconnectivity of graphs with large girth
@@ Property / cites work: Extraconnectivity of graphs with large girth / rank @@
+Normal rank
@@ Property / cites work @@
+On the extraconnectivity of graphs
@@ Property / cites work: On the extraconnectivity of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Sufficient conditions for graphs to be ??-optimal, super-edge-connected, and maximally edge-connected
+Normal rank
@@ Property / cites work @@
+Maximally edge-connected and vertex-connected graphs and digraphs: A survey
+Normal rank
@@ Property / cites work @@
+On a kind of restricted edge connectivity of graphs
+Normal rank
@@ Property / cites work @@
+Edge cuts leaving components of order at least \(m\)
+Normal rank
@@ Property / cites work @@
+A bound on 4-restricted edge connectivity of graphs
+Normal rank
@@ Property / cites work @@
+Conditional edge connectivity properties, reliability comparisons and transitivity of graphs
+Normal rank
@@ Property / cites work @@
+A proof of an inequality concerning \(k\)-restricted edge connectivity
+Normal rank
@@ Property / cites work @@
+Degree conditions for restricted-edge-connectivity and isoperimetric-edge-connectivity to be optimal
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:3057138

Sufficient conditions for a graph to be λ<sub> <i>k</i> </sub> -optimal with given girth and diameter (Q3057138): Difference between revisions

Latest revision as of 12:58, 3 July 2024

Statements

Sitelinks

Mathematics(1 entry)