شماره ركورد كنفرانس
3806
عنوان مقاله
On the Complexity of the Outer-connected Bondage Problem
پديدآورندگان
Hashemipour M mhashemi@stu.yazd.ac.ir Department of Computer Science, Yazd University, Yazd, Iran; Laboratory of Quantum Information Processing, Yazd University, Yazd, Iran , Hooshmandasl M. R hooshmandasl@yazd.ac.ir Department of Computer Science, Yazd University, Yazd, Iran; Laboratory of Quantum Information Processing, Yazd University, Yazd, Iran , Shakiba A. Department of Computer Science, Yazd University, Yazd, Iran; Laboratory of Quantum Information Processing, Yazd University, Yazd, Iran; Department of Computer Science, Vali-e-Asr Univesrity of Rafsanjan, Rafsanjan, Iran
تعداد صفحه
4
كليدواژه
Outer , connectedDomination , BondageProblem , Computational Complexity.
سال انتشار
1396
عنوان كنفرانس
دهمين كنفرانس ملي نظريه گراف و تركيبات جبري
زبان مدرك
انگليسي
چكيده فارسي
In this paper, we study the computational complexity of outer-connected bondage problem and show that it is NP-hard by a polynomial time reduction from 3-SAT problem. Moreover, we determine exact values of bondage number for several classes of graphs
كشور
ايران
لينک به اين مدرک