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

DOI10.1142/S0129054118500247zbMath1415.68159WikidataQ128990574 ScholiaQ128990574MaRDI QIDQ5384524

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

Publication date: 24 June 2019

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

zbMATH Keywords

vulnerabilitynetwork designgraph operationsedge neighbor rupture degreeedge scattering number

Mathematics Subject Classification ID

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

Related Items (2)

On agglomeration-based rupture degree in networks and a heuristic algorithm ⋮ A fast numerical method for fractional partial integro-differential equations with spatial-time delays

Cites Work

• On the bondage number of middle graphs
• Tenacity of a graph with maximum connectivity
• The rupture degree and gear graphs
• Neighbour-connectivity in regular graphs
• Optimal K-secure graphs
• A survey of integrity
• On a class of posets and the corresponding comparability graphs
• The average lower connectivity of graphs
• Edge-neighbor-rupture degree of graphs
• The average lower reinforcement number of a graph
• On the average lower bondage number of a graph
• The average scattering number of graphs
• VERTEX VULNERABILITY PARAMETER OF GEAR GRAPHS
• Neighbor Isolated Tenacity of Graphs
• The scattering number of thorn graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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