Volume 2, Issue 2

 

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

  • Graceful labelings of the generalized Petersen graphs 

    Vesel, Aleksander؛ Shao, Zehui؛ Deng, Fei؛ Li, Zepeng (Azarbaijan Shahid Madani University, 2017-09-01)
    A graceful labeling of a graph $G=(V,E)$ with $m$ edges is aninjection $f: V(G) rightarrow {0,1,ldots,m}$ such that the resulting edge labelsobtained by $|f(u)-f(v)|$ on every edge $uv$ are pairwise distinct. For natural ...

  • Primal-dual path-following algorithms for circular programming 

    Alzalg, Baha؛ Pirhaji, Mohammad (Azarbaijan Shahid Madani University, 2017-09-01)
    Circular programming problems are a new class of convex optimization problems that include second-order cone programming problems as a special case. Alizadeh and Goldfarb [Math. Program. Ser. A 95 (2003) 3-51] introduced ...

  • Some results on the complement of a new graph associated to a commutative ring 

    Visweswaran, S.؛ Parmar, Anirudhdha (Azarbaijan Shahid Madani University, 2017-09-01)
    The rings considered in this article are commutative with identity which are not fields. Let R be a ring. A. Alilou, J. Amjadi and Sheikholeslami introduced and investigated a graph whose vertex set is the set of all ...

  • Approximation Solutions for Time-Varying Shortest Path Problem 

    Shirdel, Gholam Hassan؛ Rezapour, Hassan (Azarbaijan Shahid Madani University, 2017-09-01)
    Abstract. Time-varying network optimization problems have tradition-ally been solved by specialized algorithms. These algorithms have NP-complement time complexity. This paper considers the time-varying short-est path ...

  • Reformulated F-index of graph operations 

    aram, hamideh؛ Dehgardi, Nasrin (Azarbaijan Shahid Madani University, 2017-09-01)
    The first general Zagreb index is defined as $M_1^lambda(G)=sum_{vin V(G)}d_{G}(v)^lambda$. The case $lambda=3$, is called F-index. Similarly, reformulated first general Zagreb index is defined in terms of edge-drees as ...

  • On leap Zagreb indices of graphs 

    Gutman, Ivan؛ Naji, Ahmed؛ NANDAPPA, D (Azarbaijan Shahid Madani University, 2017-09-01)
    The first and second Zagreb indices of a graph are equal, respectively, to the sum of squares of the vertex degrees, and the sum of the products of the degrees of pairs of adjacent vertices. We now consider analogous graph ...