@Article{Alzalg2017,
author="Alzalg, Baha
and Pirhaji, Mohammad",
title="Primal-dual path-following algorithms for circular programming",
journal="Communications in Combinatorics and Optimization",
year="2017",
volume="2",
number="2",
pages="65-85",
abstract="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 primal-dual path-following algorithms for solving second-order cone programming problems. In this paper, we generalize their work by using the machinery of Euclidean Jordan algebras associated with the circular cones to derive primal-dual path-following interior point algorithms for circular programming problems. We prove polynomial convergence of the proposed algorithms by showing that the circular logarithmic barrier is a strongly self-concordant barrier. The numerical examples show the path-following algorithms are simple and efficient.",
issn="2538-2128",
doi="10.22049/cco.2017.25865.1051",
url="http://comb-opt.azaruniv.ac.ir/article_13631.html"
}
@Article{Aram2017,
author="Aram, Hamideh
and Dehgardi, Nasrin",
title="Reformulated F-index of graph operations",
journal="Communications in Combinatorics and Optimization",
year="2017",
volume="2",
number="2",
pages="87-98",
abstract="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 $EM_1^lambda(G)=sum_{ein E(G)}d_{G}(e)^lambda$ and the reformulated F-index is $RF(G)=sum_{ein E(G)}d_{G}(e)^3$. In this paper, we compute the reformulated F-index for some graph operations.",
issn="2538-2128",
doi="10.22049/cco.2017.13630",
url="http://comb-opt.azaruniv.ac.ir/article_13630.html"
}
@Article{Gutman2017,
author="Gutman, Ivan
and Naji, Ahmed M
and Soner, Nandappa D",
title="On leap Zagreb indices of graphs",
journal="Communications in Combinatorics and Optimization",
year="2017",
volume="2",
number="2",
pages="99-117",
abstract="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 invariants, based on the second degrees of vertices (number of their second neighbors), called leap Zagreb indices. A number of their basic properties is established.",
issn="2538-2128",
doi="10.22049/cco.2017.25949.1059",
url="http://comb-opt.azaruniv.ac.ir/article_13643.html"
}
@Article{Visweswaran2017,
author="Visweswaran, S.
and Parmar, Anirudhdha",
title="Some results on the complement of a new graph associated to a commutative ring",
journal="Communications in Combinatorics and Optimization",
year="2017",
volume="2",
number="2",
pages="119-138",
abstract="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 nontrivial ideals of R and distinct vertices I, J are joined by an edge in this graph if and only if either ann(I)J = (0) or ann(J)I = (0). They called this graph as a new graph associated to a commutative ring.Their above mentioned work appeared in the Journal, Discrete Mathematics Algorithms and Applications. The aim of this article is to investigate the interplay between some graph- theoretic properties of the complement of a new graph associated to a commutative ring R and the ring -theoretic-properties of R.",
issn="2538-2128",
doi="10.22049/cco.2017.25908.1053",
url="http://comb-opt.azaruniv.ac.ir/article_13644.html"
}
@Article{Shirdel2017,
author="Shirdel, Gholam Hassan
and Rezapour, Hassan",
title="Approximation Solutions for Time-Varying Shortest Path Problem",
journal="Communications in Combinatorics and Optimization",
year="2017",
volume="2",
number="2",
pages="139-147",
abstract="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 problem, in which can be optimally solved in O(T(m + n)) time,where T is a given integer. For this problem with arbitrary waiting times,we propose an approximation algorithm, which can solve the problem withO(T(m+n)/ k ) time complexity such that evaluates only a subset of the valuesfor t = {0, 1, . . . , T}.",
issn="2538-2128",
doi="10.22049/cco.2017.25850.1047",
url="http://comb-opt.azaruniv.ac.ir/article_13645.html"
}
@Article{Vesel2017,
author="Vesel, Aleksander
and Shao, Zehui
and Deng, Fei
and Li, Zepeng",
title="Graceful labelings of the generalized Petersen graphs",
journal="Communications in Combinatorics and Optimization",
year="2017",
volume="2",
number="2",
pages="149-159",
abstract="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 numbers $n$ and $k$, where $n > 2k$, a generalized Petersengraph $P(n, k)$ is the graph whose vertex set is ${u_1, u_2, cdots, u_n} cup {v_1, v_2, cdots, v_n}$ and its edge set is ${u_iu_{i+1}, u_iv_i, v_iv_{i+k} : 1 leq i leq n }$, where subscript arithmetic is done modulo $n$. We propose a backtracking algorithm with a specific static variable ordering and dynamic value ordering to find graceful labelings for generalized Petersen graphs.Experimental results show that the presented approach strongly outperforms the standard backtracking algorithm. The proposed algorithm is able to find graceful labelings for all generalized Petersen graphs $P(n, k)$ with $n le 75$ within only several seconds.",
issn="2538-2128",
doi="10.22049/cco.2017.25918.1055",
url="http://comb-opt.azaruniv.ac.ir/article_13646.html"
}