Azarbaijan Shahid Madani UniversityCommunications in Combinatorics and Optimization2538-21282220170901Primal-dual path-following algorithms for circular programming65851363110.22049/cco.2017.25865.1051ENBaha AlzalgThe University of JordanMohammad PirhajiShahrekord University20170123http://comb-opt.azaruniv.ac.ir/article_13631_1eae25cfcc1e99b244e97c94b52f2f53.pdfAzarbaijan Shahid Madani UniversityCommunications in Combinatorics and Optimization2538-21282220170901Reformulated F-index of graph operations87981363010.22049/cco.2017.13630ENHamideh AramDepartment of Mathematics
Gareziaeddin Center, Khoy Branch, Islamic Azad University, Khoy, IranNasrin DehgardiDepartment of Mathematics and Computer Science,
Sirjan University of Technology
Sirjan, I.R. Iran20170318http://comb-opt.azaruniv.ac.ir/article_13630_09d978d3031bca33c8767958335c9fc5.pdfAzarbaijan Shahid Madani UniversityCommunications in Combinatorics and Optimization2538-21282220170901On leap Zagreb indices of graphs991171364310.22049/cco.2017.25949.1059ENIvan GutmanUniversity of KragujevacAhmed MNajiDepartment of Mathematics, University of Mysore, Mysusu, IndiaNandappa DSonerDepartment of Mathematics, University of Mysore, Mysuru, India20170530http://comb-opt.azaruniv.ac.ir/article_13643_fc88ed6fdf52b7f7a7ad4b621f695992.pdfAzarbaijan Shahid Madani UniversityCommunications in Combinatorics and Optimization2538-21282220170901Some results on the complement of a new graph associated to a commutative ring1191381364410.22049/cco.2017.25908.1053ENS. VisweswaranSaurashtra UniversityAnirudhdha ParmarSaurashtra University20170307http://comb-opt.azaruniv.ac.ir/article_13644_1b27eaa14546119e0ee5915425b1cb0b.pdfAzarbaijan Shahid Madani UniversityCommunications in Combinatorics and Optimization2538-21282220170901Approximation Solutions for Time-Varying Shortest Path Problem1391471364510.22049/cco.2017.25850.1047ENGholam Hassan ShirdelUniversity of QomHassan RezapourUnuversity of Qom20170103http://comb-opt.azaruniv.ac.ir/article_13645_0d39e0bfe8ae0a66991a25e4ac1ac564.pdfAzarbaijan Shahid Madani UniversityCommunications in Combinatorics and Optimization2538-21282220170901Graceful labelings of the generalized Petersen graphs1491591364610.22049/cco.2017.25918.1055ENAleksander VeselUniversity of MariborZehui ShaoSchool of Information Science & Technology, Chengdu University, Chengdu, ChinaFei DengCollege of Information Science and Technology, Chengdu University of Technology, Chengdu, ChinaZepeng LiKey Laboratory of High Confidence Software Technologies, Peking University, Peking, China20170320 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.]]>http://comb-opt.azaruniv.ac.ir/article_13646_07d33d001066dc9b0e695120e6125c8a.pdf