On the average lower bondage number of a graph
RAIRO-Oper. Res., 50 4-5 (2016) 1003-1012
Published online: 2016-11-03
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
On agglomeration-based rupture degree in networks and a heuristic algorithm
Muammer Ağtaş and Tufan TuraciActa Universitatis Sapientiae, Informatica 15 (1) 124 (2023)
https://doi.org/10.2478/ausi-2023-0010
On the average lower bondage number of graphs under join and corona operations
Tufan Turacı and Gamze KoçayNumerical Methods for Partial Differential Equations (2020)
https://doi.org/10.1002/num.22675
Exponential Independence Number of Some Graphs
Canan Çiftçi and Aysun AytaçInternational Journal of Foundations of Computer Science 29 (07) 1151 (2018)
https://doi.org/10.1142/S0129054118500260
A Comparison Between Edge Neighbor Rupture Degree and Edge Scattering Number in Graphs
Ömür Kıvanç Kürkçü and Ersin AslanInternational Journal of Foundations of Computer Science 29 (07) 1119 (2018)
https://doi.org/10.1142/S0129054118500247
The Vulnerability of Some Networks including Cycles via Domination Parameters
Tufan Turaci and Hüseyin AksanJournal of Optimization 2016 1 (2016)
https://doi.org/10.1155/2016/4705493
The Average Lower 2-Domination Number of Wheels Related Graphs and an Algorithm
Tufan TuraciMathematical and Computational Applications 21 (3) 29 (2016)
https://doi.org/10.3390/mca21030029
The average lower reinforcement number of a graph
Tufan Turaci and Ersin AslanRAIRO - Theoretical Informatics and Applications 50 (2) 135 (2016)
https://doi.org/10.1051/ita/2016015