COMPUTING THE RUPTURE DEGREE IN COMPOSITE GRAPHS
From MaRDI portal
Publication:3569273
DOI10.1142/S012905411000726XzbMath1188.05082MaRDI QIDQ3569273
Publication date: 18 June 2010
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Connectivity (05C40)
Related Items (3)
On agglomeration-based rupture degree in networks and a heuristic algorithm ⋮ Exponential Independence Number of Some Graphs ⋮ Edge Rupture Degree of Graphs
Cites Work
This page was built for publication: COMPUTING THE RUPTURE DEGREE IN COMPOSITE GRAPHS