Upper bounds on the bondage number of a graph

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Bounds on the restrained Roman domination number of a graph

A {em Roman dominating function} on a graph $G$ is a function$f:V(G)rightarrow {0,1,2}$ satisfying the condition that everyvertex $u$ for which $f(u) = 0$ is adjacent to at least one vertex$v$ for which $f(v) =2$. {color{blue}A {em restrained Roman dominating}function} $f$ is a {color{blue} Roman dominating function if the vertices with label 0 inducea subgraph with no isolated vertex.} The wei...

متن کامل

The bondage number of a graph

The bondage number b(G) of a non empty graph G is the minimum number of edger whose removal from G results in a graph having domination number greater than the domination number of G. In this paper we characterize graphs for which b(G) = p − 1 and b(G) = (γ − 1)+̇1. We also introduce the concept of uniform bondage number bu(G) and determine the exact value of bu(G) for several classes of graphs....

متن کامل

Upper bounds on the k-forcing number of a graph

Given a simple undirected graph G and a positive integer k, the k-forcing number of G, denoted Fk(G), is the minimum number of vertices that need to be initially colored so that all vertices eventually become colored during the discrete dynamical process described by the following rule. Starting from an initial set of colored vertices and stopping when all vertices are colored: if a colored ver...

متن کامل

bounds on the restrained roman domination number of a graph

a {em roman dominating function} on a graph $g$ is a function$f:v(g)rightarrow {0,1,2}$ satisfying the condition that everyvertex $u$ for which $f(u) = 0$ is adjacent to at least one vertex$v$ for which $f(v) =2$. {color{blue}a {em restrained roman dominating}function} $f$ is a {color{blue} roman dominating function if the vertices with label 0 inducea subgraph with no isolated vertex.} the wei...

متن کامل

a study on the effectiveness of textual modification on the improvement of iranian upper-intermediate efl learners’ reading comprehension

این پژوهش به منظور بررسی تأثیر اصلاح متنی بر بهبود توانایی درک مطلب زبان آموزان ایرانی بالاتر از سطح میانی انجام پذیرفت .بدین منظور 115 دانشجوی مرد و زن رشته مترجمی زبان انگلیسی در این پزوهش شرکت نمودند.

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Electronic Journal of Graph Theory and Applications

سال: 2018

ISSN: 2338-2287

DOI: 10.5614/ejgta.2018.6.1.1