Edge-rupture degree of a graph

MaRDI QIDQ5260895zbMATH OpenFDO

Authors Ersin Aslan

Publication date 30 June 2015

Full work available at URL http://online.watsci.org/abstract_pdf/2015v22/v22n2b-pdf/5.pdf, http://online.watsci.org/fulltext_b_pdf/2015v22/v22n2b-pdf/5.pdf

zbMATH Keywords

connectivityedge rupture degreenetworksrupture degree

Mathematics Subject Classification ID

Connectivity (05C40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• On edge-rupture degree of graphs
• Edge Rupture Degree of Graphs
• Edge-neighbor-rupture degree of graphs
• Rupture degree of graphs
• Some results for the rupture degree

Cited in

(8)

• On edge-rupture degree of graphs
• Edge-neighbor-rupture degree of graphs
• The condition of rupture degree for a graph having k-tree
• scientific article; zbMATH DE number 6847548 (Why is no real title available?)
• Edge Rupture Degree of Graphs
• scientific article; zbMATH DE number 6453262 (Why is no real title available?)
• A Comparison Between Edge Neighbor Rupture Degree and Edge Scattering Number in Graphs
• On agglomeration-based rupture degree in networks and a heuristic algorithm

This page was built for publication: Edge-rupture degree of a graph

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