Volume 1, Issue 1


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

  • The convex domination subdivision number of a graph 

    Dettlaff, M.؛ Kosari, S.؛ Lemanska, Magda؛ Sheikholeslami, Seyed Mahmoud (Azarbaijan Shahid Madani University, 2016-06-01)
    Let $G=(V,E)$ be a simple graph. A set $Dsubseteq V$ is adominating set of $G$ if every vertex in $Vsetminus D$ has atleast one neighbor in $D$. The distance $d_G(u,v)$ between twovertices $u$ and $v$ is the length of a ...

  • Bounds on the restrained Roman domination number of a graph 

    Abdollahzadeh Ahangar, Hossein؛ Mehdipour, R. (Azarbaijan Shahid Madani University, 2016-06-01)
    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 ...

  • New bounds on proximity and remoteness in graphs 

    Dankelmann, Peter (Azarbaijan Shahid Madani University, 2016-06-01)
    The average distance of a vertex $v$ of a connected graph $G$is the arithmetic mean of the distances from $v$ to allother vertices of $G$. The proximity $pi(G)$ and the remoteness $rho(G)$of $G$ are defined as the minimum ...

  • Sufficient conditions on the zeroth-order general Randic index for maximally edge-connected digraphs 

    Volkmann, Lutz (Azarbaijan Shahid Madani University, 2016-06-01)
    Let D be a digraph with vertex set V(D) .For vertex v V(D), the degree of v, denoted by d(v), is defined as the minimum value if its out-degree  and its in-degree . Now let D be a digraph with minimum degree  and ...

  • The minus k-domination numbers in graphs 

    Dehgardi, Nasrin (Azarbaijan Shahid Madani University, 2016-06-01)
    For any integer  ‎, ‎a minus  k-dominating function is a‎function  f‎ : ‎V (G)  {-1,0‎, ‎1} satisfying w) for every  vertex v, ‎where N(v) ={u V(G) | uv  E(G)}  and N[v] =N(v)cup {v}. ‎The minimum of ‎the values of  v)‎, ...

  • More skew-equienergetic digraphs 

    Adiga, Chandrashekar؛ B R, Rakshith (Azarbaijan Shahid Madani University, 2016-06-01)
    Two digraphs of same order are said to be skew-equienergetic if their skew energies are equal. One of the open problems proposed by Li and Lian was to construct non-cospectral skew-equienergetic digraphs on n vertices. ...