نتایج جستجو برای: Signed Roman $k$-dominating function

تعداد نتایج: 1571544  

Let $kgeq 1$ be an integer, and $G=(V,E)$ be a finite and simplegraph. The closed neighborhood $N_G[e]$ of an edge $e$ in a graph$G$ is the set consisting of $e$ and all edges having a commonend-vertex with $e$. A signed Roman edge $k$-dominating function(SREkDF) on a graph $G$ is a function $f:E rightarrow{-1,1,2}$ satisfying the conditions that (i) for every edge $e$of $G$, $sum _{xin N[e]} f...

Journal: :communication in combinatorics and optimization 0
nasrin dehgardi sirjan university of technology, sirjan 78137, iran lutz volkmann lehrstuhl ii fur mathematik, rwth aachen university, 52056 aachen, germany

let $d$ be a finite and simple digraph with vertex set $v(d)$‎.‎a signed total roman $k$-dominating function (str$k$df) on‎‎$d$ is a function $f:v(d)rightarrow{-1‎, ‎1‎, ‎2}$ satisfying the conditions‎‎that (i) $sum_{xin n^{-}(v)}f(x)ge k$ for each‎‎$vin v(d)$‎, ‎where $n^{-}(v)$ consists of all vertices of $d$ from‎‎which arcs go into $v$‎, ‎and (ii) every vertex $u$ for which‎‎$f(u)=-1$ has a...

Let $D$ be a finite and simple digraph with vertex set $V(D)$‎.‎A signed total Roman $k$-dominating function (STR$k$DF) on‎‎$D$ is a function $f:V(D)rightarrow{-1‎, ‎1‎, ‎2}$ satisfying the conditions‎‎that (i) $sum_{xin N^{-}(v)}f(x)ge k$ for each‎‎$vin V(D)$‎, ‎where $N^{-}(v)$ consists of all vertices of $D$ from‎‎which arcs go into $v$‎, ‎and (ii) every vertex $u$ for which‎‎$f(u)=-1$ has a...

Let $kge 1$ be an integer, and let $G$ be a finite and simple graph with vertex set $V(G)$.A weak signed Roman $k$-dominating function (WSRkDF) on a graph $G$ is a function$f:V(G)rightarrow{-1,1,2}$ satisfying the conditions that $sum_{xin N[v]}f(x)ge k$ for eachvertex $vin V(G)$, where $N[v]$ is the closed neighborhood of $v$. The weight of a WSRkDF $f$ is$w(f)=sum_{vin V(G)}f(v)$. The weak si...

Journal: :Discrete Applied Mathematics 2015
Lutz Volkmann

A signed Roman dominating function (SRDF) on a graph G is a function f : V (G) → {−1, 1, 2} such that u∈N [v] f(u) ≥ 1 for every v ∈ V (G), and every vertex u ∈ V (G) for which f(u) = −1 is adjacent to at least one vertex w for which f(w) = 2. A set {f1, f2, . . . , fd} of distinct signed Roman dominating functions on G with the property that ∑d i=1 fi(v) ≤ 1 for each v ∈ V (G), is called a sig...

Journal: :EJGTA 2015
Seyed Mahmoud Sheikholeslami Lutz Volkmann

A signed Roman dominating function on the digraphD is a function f : V (D) −→ {−1, 1, 2} such that ∑ u∈N−[v] f(u) ≥ 1 for every v ∈ V (D), where N−[v] consists of v and all inner neighbors of v, and every vertex u ∈ V (D) for which f(u) = −1 has an inner neighbor v for which f(v) = 2. A set {f1, f2, . . . , fd} of distinct signed Roman dominating functions on D with the property that ∑d i=1 fi(...

Journal: :Australasian J. Combinatorics 2016
Lutz Volkmann

Let k ≥ 1 be an integer. A signed Roman k-dominating function on a digraph D is a function f : V (D) −→ {−1, 1, 2} such that ∑x∈N−[v] f(x) ≥ k for every v ∈ V (D), where N−[v] consists of v and all in-neighbors of v, and every vertex u ∈ V (D) for which f(u) = −1 has an in-neighbor w for which f(w) = 2. A set {f1, f2, . . . , fd} of distinct signed Roman k-dominating functions on D with the pro...

2017
Nasrin Dehgardi Lutz Volkmann

Let D be a finite and simple digraph with vertex set V (D). A signed total Roman k-dominating function (STRkDF) on D is a function f : V (D) → {−1, 1, 2} satisfying the conditions that (i) ∑ x∈N−(v) f(x) ≥ k for each v ∈ V (D), where N−(v) consists of all vertices of D from which arcs go into v, and (ii) every vertex u for which f(u) = −1 has an inner neighbor v for which f(v) = 2. The weight o...

Let $D$ be a finite simple digraph with vertex set $V(D)$ and arcset $A(D)$. A twin signed total Roman dominating function (TSTRDF) on thedigraph $D$ is a function $f:V(D)rightarrow{-1,1,2}$ satisfyingthe conditions that (i) $sum_{xin N^-(v)}f(x)ge 1$ and$sum_{xin N^+(v)}f(x)ge 1$ for each $vin V(D)$, where $N^-(v)$(resp. $N^+(v)$) consists of all in-neighbors (resp.out-neighbors) of $v$, and (...

A {em weak signed Roman dominating function} (WSRDF) of a graph $G$ with vertex set $V(G)$ is defined as afunction $f:V(G)rightarrow{-1,1,2}$ having the property that $sum_{xin N[v]}f(x)ge 1$ for each $vin V(G)$, where $N[v]$ is theclosed neighborhood of $v$. The weight of a WSRDF is the sum of its function values over all vertices.The weak signed Roman domination number of $G...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید

function paginate(evt) { url=/search_year_filter/ var term=document.getElementById("search_meta_data").dataset.term pg=parseInt(evt.target.text) var data={ "year":filter_year, "term":term, "pgn":pg } filtered_res=post_and_fetch(data,url) window.scrollTo(0,0); } function update_search_meta(search_meta) { meta_place=document.getElementById("search_meta_data") term=search_meta.term active_pgn=search_meta.pgn num_res=search_meta.num_res num_pages=search_meta.num_pages year=search_meta.year meta_place.dataset.term=term meta_place.dataset.page=active_pgn meta_place.dataset.num_res=num_res meta_place.dataset.num_pages=num_pages meta_place.dataset.year=year document.getElementById("num_result_place").innerHTML=num_res if (year !== "unfilter"){ document.getElementById("year_filter_label").style="display:inline;" document.getElementById("year_filter_place").innerHTML=year }else { document.getElementById("year_filter_label").style="display:none;" document.getElementById("year_filter_place").innerHTML="" } } function update_pagination() { search_meta_place=document.getElementById('search_meta_data') num_pages=search_meta_place.dataset.num_pages; active_pgn=parseInt(search_meta_place.dataset.page); document.getElementById("pgn-ul").innerHTML=""; pgn_html=""; for (i = 1; i <= num_pages; i++){ if (i===active_pgn){ actv="active" }else {actv=""} pgn_li="
  • " +i+ "
  • "; pgn_html+=pgn_li; } document.getElementById("pgn-ul").innerHTML=pgn_html var pgn_links = document.querySelectorAll('.mypgn'); pgn_links.forEach(function(pgn_link) { pgn_link.addEventListener('click', paginate) }) } function post_and_fetch(data,url) { showLoading() xhr = new XMLHttpRequest(); xhr.open('POST', url, true); xhr.setRequestHeader('Content-Type', 'application/json; charset=UTF-8'); xhr.onreadystatechange = function() { if (xhr.readyState === 4 && xhr.status === 200) { var resp = xhr.responseText; resp_json=JSON.parse(resp) resp_place = document.getElementById("search_result_div") resp_place.innerHTML = resp_json['results'] search_meta = resp_json['meta'] update_search_meta(search_meta) update_pagination() hideLoading() } }; xhr.send(JSON.stringify(data)); } function unfilter() { url=/search_year_filter/ var term=document.getElementById("search_meta_data").dataset.term var data={ "year":"unfilter", "term":term, "pgn":1 } filtered_res=post_and_fetch(data,url) } function deactivate_all_bars(){ var yrchart = document.querySelectorAll('.ct-bar'); yrchart.forEach(function(bar) { bar.dataset.active = false bar.style = "stroke:#71a3c5;" }) } year_chart.on("created", function() { var yrchart = document.querySelectorAll('.ct-bar'); yrchart.forEach(function(check) { check.addEventListener('click', checkIndex); }) }); function checkIndex(event) { var yrchart = document.querySelectorAll('.ct-bar'); var year_bar = event.target if (year_bar.dataset.active == "true") { unfilter_res = unfilter() year_bar.dataset.active = false year_bar.style = "stroke:#1d2b3699;" } else { deactivate_all_bars() year_bar.dataset.active = true year_bar.style = "stroke:#e56f6f;" filter_year = chart_data['labels'][Array.from(yrchart).indexOf(year_bar)] url=/search_year_filter/ var term=document.getElementById("search_meta_data").dataset.term var data={ "year":filter_year, "term":term, "pgn":1 } filtered_res=post_and_fetch(data,url) } } function showLoading() { document.getElementById("loading").style.display = "block"; setTimeout(hideLoading, 10000); // 10 seconds } function hideLoading() { document.getElementById("loading").style.display = "none"; } -->