Volume 5, Issue 2

 

ارسال های اخیر

  • Bounds on signed total double Roman domination 

    Shahbazi, L.؛ Abdollahzadeh Ahangar, Hossein؛ khoeilar, rana؛ Sheikholeslami, Seyed Mahmoud (Azarbaijan Shahid Madani University, 2020-12-01)
    A signed total double Roman dominating function (STDRDF) on {color{blue}an} isolated-free graph $G=(V,E)$ is afunction $f:V(G)rightarrow{-1,1,2,3}$ such that (i) every vertex $v$ with $f(v)=-1$ has at least twoneighbors ...

  • Outer-weakly convex domination number of graphs 

    Dayap, Jonecis؛ Alcantara, Richard؛ Anoos, Roma (Azarbaijan Shahid Madani University, 2020-12-01)
    For a given simple graph $G=((V(G),E(G))$, a set $Ssubseteq V(G)$ is an outer-weakly convex dominating set if every vertex not in $S$ is adjacent to some vertex in $S$ and $V(G)setminus S$ is a weakly convex set. The ...

  • New results on upper domatic number of graphs 

    Samuel, Libin؛ JOSEPH, MAYAMMA (Azarbaijan Shahid Madani University, 2020-12-01)
    For a graph $G = (V, E)$, a partition $pi = {V_1,$ $V_2,$ $ldots,$ $V_k}$ of the vertex set $V$ is an textit{upper domatic partition} if $V_i$ dominates $V_j$ or $V_j$ dominates $V_i$ or both for every $V_i, V_j in pi$, ...

  • Total Roman domination subdivision number in graphs 

    amjadi, jafar (Azarbaijan Shahid Madani University, 2020-12-01)
    A {em Roman dominating function} on a graph $G$ is a function $f:V(G)rightarrow {0,1,2}$ satisfying the condition that every vertex $u$ for which $f(u)=0$ is adjacent to at least one vertex $v$ for which $f(v)=2$. A {em ...

  • Nonnegative signed total Roman domination in graphs 

    Dehgardi, Nasrin؛ Volkmann, Lutz (Azarbaijan Shahid Madani University, 2020-12-01)
    ‎Let $G$ be a finite and simple graph with vertex set $V(G)$‎. ‎A nonnegative signed total Roman dominating function (NNSTRDF) on a‎ ‎graph $G$ is a function $f:V(G)rightarrow{-1‎, ‎1‎, ‎2}$ satisfying the conditions‎‎that ...

  • Some new bounds on the general sum--connectivity index 

    Ali, Akbar؛ Javaid, Mubeen؛ Matejic, Marjan؛ Milovanovic, Igor؛ Milovanovic, Emina (Azarbaijan Shahid Madani University, 2020-12-01)
    Let $G=(V,E)$ be a simple connectedgraph with $n$ vertices, $m$ edges and sequence of vertex degrees$d_1 ge d_2 ge cdots ge d_n>0$, $d_i=d(v_i)$, where $v_iin V$. With $isim j$ we denote adjacency ofvertices $v_i$ and ...