A Comparison Between Edge Neighbor Rupture Degree and Edge Scattering Number in Graphs

DOI10.1142/S0129054118500247MaRDI QIDQ5384524zbMATH OpenWikidataFDO

Authors Ömür Kıvanç Kürkçü, Ersin Aslan

Publication date 24 June 2019

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S0129054118500247

zbMATH Keywords

edge neighbor rupture degreeedge scattering numbergraph operationsnetwork designvulnerability

Mathematics Subject Classification ID

Reliability, testing and fault tolerance of networks and computer systems (68M15) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Edge-neighbor-scattering number of graphs
• Edge-neighbor-rupture degree of graphs
• On edge-rupture degree of graphs
• A measure of graphs vulnerability: edge scattering number
• Edge Rupture Degree of Graphs
• Neighbor rupture degree of total graphs and their complements
• Bounds for scattering number and rupture degree of graphs with genus
• scientific article; zbMATH DE number 6453262
• Edge-rupture degree of a graph
• scientific article; zbMATH DE number 6847548

Cites work

• A measure of graphs vulnerability: edge scattering number
• A survey of integrity
• Edge scattering number of gear graphs
• Edge-neighbor-rupture degree of graphs
• Graph operations and neighbor-integrity.
• scientific article; zbMATH DE number 4053662 (Why is no real title available?)
• scientific article; zbMATH DE number 3628999 (Why is no real title available?)
• scientific article; zbMATH DE number 731853 (Why is no real title available?)
• scientific article; zbMATH DE number 5050554 (Why is no real title available?)
• scientific article; zbMATH DE number 3290993 (Why is no real title available?)
• Neighbor Isolated Tenacity of Graphs
• Neighbor rupture degree and the relations between other parameters.
• Neighbor toughness of graphs
• Neighbour-connectivity in regular graphs
• On a class of posets and the corresponding comparability graphs
• On the average lower bondage number of a graph
• On the bondage number of middle graphs
• Optimal K-secure graphs
• Tenacity of a graph with maximum connectivity
• The average lower connectivity of graphs
• The average lower reinforcement number of a graph
• The average scattering number of graphs
• The bondage number of some graphs
• The rupture degree and gear graphs
• The scattering number of thorn graphs
• Vertex vulnerability parameter of gear graphs
• Vertex-neighbor-integrity of powers of cycles
• Vulnerability of Mycielski graphs via residual closeness.

Cited in

(4)

• A fast numerical method for fractional partial integro-differential equations with spatial-time delays
• A measure of graphs vulnerability: edge scattering number
• scientific article; zbMATH DE number 6453262 (Why is no real title available?)
• On agglomeration-based rupture degree in networks and a heuristic algorithm

This page was built for publication: A Comparison Between Edge Neighbor Rupture Degree and Edge Scattering Number in Graphs

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