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

Rupture degree of mesh and binary trees

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

zbMATH Open1201.05054MaRDI QIDQ3620784FDOQ3620784


Authors: Paul Manuel, R. Prabha, Indra Rajasingh, Bharati Rajan Edit this on Wikidata


Publication date: 14 April 2009





Recommendations

  • The rupture degree of trees
  • The rupture degree of some graphs
  • Rupture degree of graphs
  • Extremal graphs with given order and the rupture degree
  • Some results for the rupture degree


zbMATH Keywords

binary treesminimum vertex covernetwork vulnerabilityrupture degreevertex-toughness


Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Connectivity (05C40)



Cited In (2)

  • The rupture degree of trees
  • Title not available (Why is that?)





This page was built for publication: Rupture degree of mesh and binary trees

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

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