Characterizations of strength extremal graphs

DOI10.1007/s00373-013-1359-zzbMath1306.05106OpenAlexW2094875343MaRDI QIDQ489310

Senmei Yao, Hong-Jian Lai, Xiaofeng Gu, Ping Li

Publication date: 20 January 2015

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-013-1359-z

zbMATH Keywords

network reliabilityedge-disjoint spanning treesedge connectivity\(k\)-maximal graphsnetwork strength

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15) Connectivity (05C40)

Related Items (2)

On dense strongly \(\mathbb{Z}_{2 s + 1}\)-connected graphs ⋮ Mod $(2p+1)$-Orientation on Bipartite Graphs and Complementary Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Characterization of removable elements with respect to having \(k\) disjoint bases in a matroid
• An edge extremal result for subcohesion
• Fractional arboricity, strength, and principal partitions in graphs and matroids
• An extension of Brooks' theorem to n-degenerate graphs
• Minimale \(n\)-fach kantenzusammenhängende Graphen
• On the Problem of Decomposing a Graph into n Connected Factors
• Edge-Disjoint Spanning Trees of Finite Graphs
• Optimal attack and reinforcement of a network
• The size of strength‐maximal graphs
• k-Components, Clusters and Slicings in Graphs
• On the spanning tree packing number of a graph: A survey

This page was built for publication: Characterizations of strength extremal graphs