|کد مقاله||کد نشریه||سال انتشار||مقاله انگلیسی||ترجمه فارسی||نسخه تمام متن|
|5128241||1489490||2017||5 صفحه PDF||سفارش دهید||دانلود کنید|
The independent vertex-edge domination number and the upper non-enclaving number of a graph G are denoted by ive(G) and Î¨(G), respectively. Boutrig et al. posed the following question: Let G be a connected graph with order n. Is Î¨(G)+ive(G)â¤n?In this paper, we provide an infinite family of counterexamples. A new relationship between Î¨(G) and ive(G) is established. Furthermore, if G is a connected cubic graph, we answer this question in the affirmative.
Journal: Discrete Optimization - Volume 25, August 2017, Pages 1-5