ویراساینس.
سند علمی

Signed edge majority domination numbers in graphs

Hosein Karami, Seyed Mahmoud Sheikholeslami, Abdollah Khodkar

چکیده

The open neighborhood NG(e) of an edge e in a graph G is the set consisting of all edges having a common end-vertex with e and its closed neighborhood is NG[e] = NG(e) ∪ {e}. Let f be a function on E(G), the edge set of G, into the set {−1, 1}. If ∑x∈NG[e] f(x) ≥ 1 for at least a half of the edges e ∈ E(G), then f is called a signed edge majority dominating function of G. The minimum of the values of ∑ e∈E(G) f(e), taken over all signed edge majority dominating functions f of G, is called the signed edge majority domination number of G and is denoted by γ sm(G). In this paper we initiate the study of signed edge majority domination in graphs. We first use an existing upper bound for the majority domination numbers of graphs to present an upper bound for signed edge majority domination numbers of graphs. Then we establish a sharp lower bound for the signed edge majority domination number of a graph. ∗ Research supported by a Faculty Research Grant, University of West Georgia. 292 H. KARAMI, S.M. SHEIKHOLESLAMI AND A. KHODKAR

اسناد مشابه

  • On Signed Edge Total Domination Numbers of Graphs

    سند علمی۲۰۱۱Jin Feng ZHAO, Bao Gen XU, B. G. XU

    For the terminology and notations not defined here, we adopt those in Bondy and Murty [1] and Xu [2] and consider simple graphs only. Let G = (V,E) be a graph with vertex set V = V (G) and edge set E = E(G). For any vertex v ∈ V , NG(v) denotes the open neighborhood of v in G and

  • Lower bounds on signed edge total domination numbers in graphs

    مقاله‌ی دسترسی آزاد۲۰۰۸Czechoslovak Mathematical JournalH.Karami, S. M.Sheikholeslami, AbdollahKhodkar

  • On the signed Roman edge k-domination in graphs

    مقاله۲۰۱۷Communication in Combinatorics and OptimizationAkram Mahmoodi

    Let $k\geq 1$ be an integer, and $G=(V,E)$ be a finite and simple graph. 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 common end-vertex with $e$. A signed Roman edge $k$-dominating function (SREkDF) on a graph

  • On the Signed (Total) $k$-Domination Number of a Graph

    سند علمی۲۰۱۲CoRRHongyu Liang

    Let k be a positive integer and G = (V,E) be a graph of minimum degree at least k − 1. A function f : V → {−1, 1} is called a signed k-dominating function of G if ∑ u∈NG[v] f(u) ≥ k for all v ∈ V . The signed k-domination number of G is the minimum value of ∑ v∈V f(v) taken over

  • On the edge geodetic and edge geodetic domination numbers of a graph

    مقاله۲۰۲۰Communication in Combinatorics and OptimizationVladimir Samodivkin

    In this paper, we study both concepts of geodetic dominating and edge geodetic dominating sets and derive some tight upper bounds on the edge geodetic and the edge geodetic domination numbers. We also obtain attainable upper bounds on the maximum number of elements in a partition

  • Signed edge k-subdomination numbers in graphs

    سند علمی۲۰۱۳Ars Comb.Abdollah Khodkar, Reza Saei, Seyed Mahmoud Sheikholeslami

    The closed neighborhood NG[e] of an edge e in a graph G is the set consisting of e and of all edges having a common end-vertex with e. Let f be a function on E(G), the edge set of G, into the set {−1, 1}. If ∑ x∈N [e] f(x) ≥ 1 for at least k edges e of G, then f is called a signe