Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

The weak rupture degree of graphs and the network invulnerability

From MaRDI portal
Publication:3380862
Jump to:navigation, search

DOI10.3969/J.ISSN.1005-3085.2021.03.006zbMATH Open1488.05467MaRDI QIDQ3380862FDOQ3380862

Yong Liu, Zongtian Wei, Chao Yue, Shushu Yang

Publication date: 29 September 2021





Recommendations

  • The weak rupture degree of graphs
  • Weak-rupture degree of graphs
  • Neighbor rupture degree and the relations between other parameters.
  • The relationship between rupture degree and other vulnerability parameters
  • On edge-rupture degree of graphs


zbMATH Keywords

combinatorial optimizationweak rupture degreenetwork invulnerability


Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Connectivity (05C40)



Cited In (2)

  • Title not available (Why is that?)
  • Isolated Rupture in Composite Networks





This page was built for publication: The weak rupture degree of graphs and the network invulnerability

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3380862)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3380862&oldid=16656858"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 4 February 2024, at 16:24. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki