Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

On Signed Star Domination in Graphs

On Signed Star Domination in Graphs For a graph G = (V, E) without isolated vertex, a function f: E(G) → {−1, 1} is said to be a signed star dominating function of G $$\sum\limits_{e \in E(v)} {f(e) \ge 1} $$ for every v ∈ V(G), where E(v) = {uv} ∈ E(G)∣ u ∈ V(G)}. The minimum value of $$\sum\limits_{e \in E(G)} {f(e)} $$ , taken over all signed star dominating functions f of G, is called the signed star domination number of G and is denoted by γss(G). This paper studies the bounds and algorithms of signed star domination numbers in some classes of graphs. In particular, sharp bounds for the signed star domination number of a general graph and a linear-time algorithm for the signed star domination problem in a tree is presented. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Acta Mathematicae Applicatae Sinica Springer Journals

On Signed Star Domination in Graphs

Download PDF
6 pages

Loading next page...
 
/lp/springer-journals/on-signed-star-domination-in-graphs-vjAUza0HV5
Publisher
Springer Journals
Copyright
Copyright © 2019 by The Editorial Office of AMAS & Springer-Verlag GmbH Germany
Subject
Mathematics; Applications of Mathematics; Math Applications in Computer Science; Theoretical, Mathematical and Computational Physics
ISSN
0168-9673
eISSN
1618-3932
DOI
10.1007/s10255-019-0816-8
Publisher site
See Article on Publisher Site

Abstract

For a graph G = (V, E) without isolated vertex, a function f: E(G) → {−1, 1} is said to be a signed star dominating function of G $$\sum\limits_{e \in E(v)} {f(e) \ge 1} $$ for every v ∈ V(G), where E(v) = {uv} ∈ E(G)∣ u ∈ V(G)}. The minimum value of $$\sum\limits_{e \in E(G)} {f(e)} $$ , taken over all signed star dominating functions f of G, is called the signed star domination number of G and is denoted by γss(G). This paper studies the bounds and algorithms of signed star domination numbers in some classes of graphs. In particular, sharp bounds for the signed star domination number of a general graph and a linear-time algorithm for the signed star domination problem in a tree is presented.

Journal

Acta Mathematicae Applicatae Sinica – Springer Journals

Published: May 15, 2019

References

  • On the signed edge domination number of graphs
    Akbari, S; Bolouki, S; Hatami, P; Siami, M
  • Graceful signed stars
    Acharya, M; Singh, TS
  • Signed star domatic number of a graph
    Atapour, M; Sheikholeslami, SM; Ghameshlou, AN; Volkmann, L
  • The signed star domination number of Cayley graphs
    Chelvam, TT; Kalaimurugan, G; Chou, WY
  • Fundamentals of Domination in Graphs
    Haynes, TW; Hedetniemi, ST; Slater, PJ
  • Some notes on signed edge domination in graphs
    Karami, H; Sheikholeslami, SM; Khodkar, A
  • Signed edge majority total domination numbers in graphs
    Karami, H; Sheikholeslami, SM; Khodkar, A
  • Signed star k-subdomination numbers in graphs
    Saei, R; Sheikholeslami, SM
  • Signed star k-domatic number of a graph
    Sheikholeslami, SM; Volkmann, L
  • The signed star domination numbers of the Cartesian product graphs
    Wang, CP
  • On signed edge domination numbers of graphs
    Xu, B
  • Note on edge domination numbers of graphs
    Xu, B
  • Signed star part domination numbers of graphs
    Zhou, ZW