Extreme tenacity of graphs with given order and size

DOI10.1007/s40305-014-0052-0zbMath1306.90026arXiv1109.4673OpenAlexW2039617196MaRDI QIDQ489128

Yin-Kui Li, Chuan-Dong Xu, Sheng Gui Zhang, Cheng, T. C. Edwin

Publication date: 27 January 2015

Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1109.4673

zbMATH Keywords

treesmaximum tenacityminimum tenacityvulnerability parameters

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Communication networks in operations research (90B18) Graph theory (including graph drawing) in computer science (68R10) Reliability, availability, maintenance, inspection in operations research (90B25) Deterministic network models in operations research (90B10) Density (toughness, etc.) (05C42)

Related Items (1)

Unnamed Item

Cites Work

• A large class of maximally tough graphs
• On a class of posets and the corresponding comparability graphs
• Connectivity and edge-disjoint spanning trees
• Tough graphs and Hamiltonian circuits.
• Tenacity of complete graph products and grids
• Edge‐tenacious networks
• Rupture degree of graphs
• THE MAXIMUM CONNECTIVITY OF A GRAPH
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Extreme tenacity of graphs with given order and size