scientific article

From MaRDI portal

Revision as of 21:52, 3 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3123938

Jump to:navigation, search

zbMath0865.05055MaRDI QIDQ3123938

Kezhi Ouyang, Wenchi Yu, Keyi Ouyang

Publication date: 9 March 1997

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

algorithms connectivity invariant trees separating set toughness connected graphs number of components relative breaktivity reliable communication networks

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Connectivity (05C40)

Related Items (4)

The average scattering number of graphs ⋮ Extreme tenacity of graphs with given order and size ⋮ A polynomial algorithm for computing the weak rupture degree of trees ⋮ Bounds for scattering number and rupture degree of graphs with genus

This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3123938&oldid=16221340"