University of TehranJournal of Algorithms and Computation50120180601Sharp Upper bounds for Multiplicative Version of Degree Distance and Multiplicative Version of Gutman Index of Some Products of Graphs1287989ENR. MuruganandamDepartment of Mathematics, Government Art College,TiruchirappalliR.S. ManikandanDepartment of Mathematics, Bharathidasan University Constituent College, Lalgudi, TiruchirappalliM.Aruvi AruviDepartment of Mathematics, Anna University, Tiruchirappalli, India20180330https://jac.ut.ac.ir/article_7989_356861646605b630fbf9fe3d6c43283b.pdfUniversity of TehranJournal of Algorithms and Computation50120180601Improved label propagation algorithms with node attribute and link strength for community detection295068238ENMohsen ArabYazd universityMahdieh HasheminezhadYazd university20180225https://jac.ut.ac.ir/article_68238_1708e04d7995d0e202872c173eb66567.pdfUniversity of TehranJournal of Algorithms and Computation50120180601Tree Technology for Memory Confidentiality Integrity Protection516768338ENHui Min MengSchool of Information Science and Engineering, Dalian Polytechnic University, Dalian, China ,116034.HongJin WangSchool of Information Science and Engineering, Dalian Polytechnic University, Dalian, China ,116034.NianMin YaoFauclty of Electronic Information Science and Engineering, Dalian University of Technology, Dalian, China, 116024ShunYi ChengFauclty of Electronic Information Science and Engineering, Dalian University of Technology, Dalian, China, 11602420180208https://jac.ut.ac.ir/article_68338_0a7e4f4334e2402b0b30c24b72ac86b6.pdfUniversity of TehranJournal of Algorithms and Computation50120180601Improper Filter Reduction699968340ENFatemehzahra SaberifarDepartment of Mathematics and Computer Science, Amirkabir University of Technology, Tehran, Iran.Ali MohadesAmirkabir University of TechnologyMohammadreza RazzaziAmirkabir University of TechnologyJason J. M. O'KaneUniversity of South Carolina20180208https://jac.ut.ac.ir/article_68340_4cb7b0907ca92ebe199a2f85d9a913d3.pdfUniversity of TehranJournal of Algorithms and Computation50120180601One Modulo Three Geometric Mean Graphs10110868342ENP. JeyanthiGovindammal Aditanar College for Women Tiruchendur-628 215, Tamil Nadu, India.A. MaheswariDepartment of Mathematics Kamaraj College of Engineering and Technology Virudhunagar- 626 001, Tamil Nadu, IndiaP. PandiarajDepartment of Mathematics Kamaraj College of Engineering and Technology Virudhunagar- 626 001, Tamil Nadu, India20180128https://jac.ut.ac.ir/article_68342_e53cdfd892a4cf9b99d51c533e8902a6.pdfUniversity of TehranJournal of Algorithms and Computation50120180601Vulnerability in Networks - A Survey10911868367ENDara MoazzamiDepartment of Algorithms and Computation, Faculty of Engineering Science, School of Engineering, University of Tehran, Iran,
and
Department of Mathematics, UCLA, California, USA20180102https://jac.ut.ac.ir/article_68367_d654cd37f3a5b5efa2f7cdae6f35e6c2.pdfUniversity of TehranJournal of Algorithms and Computation50120180601Pointed Conflict-Free Colouring of Digraphs11913168425ENMahdieh HasheminezhadYazd university201805070$. Nevertheless for paths and cycles, one can in linear time find a PCFP colouring with a minimum number of colours and for a given tree, one can find a PCFP 2-colouring. In this paper a bipartite digraph whose arcs start from the same part is called a one-way bipartite digraph. It is proved every one-way bipartite planar digraph has a PCFP 6-colouring, every one-way bipartite planar digraph whose each vertex has in-degree zero or greater than one, has a PCFP 5-colouring and every one-way bipartite planar digraph whose each vertex has in-degree zero or greater than two, has a PCFP 2-colouring. Two simple algorithms are proposed for finding a PCFP colouring of a given digraph such that the number of colours used is not more than the maximum out-degree of the vertices. For a digraph with a given PCFP colouring, it is shown how to recolour the vertices after vertex or arc insertion or deletion to obtain a PCFP colouring for the new digraph.]]>https://jac.ut.ac.ir/article_68425_30d4b1e068528f6d75397022bf311040.pdfUniversity of TehranJournal of Algorithms and Computation50120180601Defining the Tipping Point Based on Conditionally Convergent Series: Explaining the Indeterminacy13314268630ENMohammad Hosseini MoghaddamACECR, Institute for Humanities and Social SciencesTahmineh SahverdiACECR, Institute for Humanities and Social Sciences20180112https://jac.ut.ac.ir/article_68630_8c0a9cd094be42ea9ddb0cdc693c0d32.pdfUniversity of TehranJournal of Algorithms and Computation50120180601$k$-Total prime cordial labeling of graphs14314968651ENR PonrajDepartment of Mathematics,
Sri Paramakalyani College,
Alwarkurichi-627412J MaruthamaniResearch Scholar,
Department of Mathematics
Manonmaniam sundarnar university, Abishekapatti,
Tirunelveli-627 012,
Tamilnadu, India.R KalaDepartment of Mathematics,
Manonmaniam sundarnar university, Abishekapatti,
Tirunelveli-627 012, Tamilnadu, India.201802071$. For each edge $uv$, assign the label $gcd(f(u),f(v))$. $f$ is called $k$-Total prime cordial labeling of $G$ if $left|t_{f}(i)-t_{f}(j)right|leq 1$, $i,j in {1,2, ldots, k}$ where $t_{f}(x)$ denotes the total number of vertices and the edges labeled with $x$. We investigate k-total prime cordial labeling of some graphs and study the 4-total prime cordial labeling of path, cycle, complete graph etc.]]>https://jac.ut.ac.ir/article_68651_1dc2872652857fc9a585a106b9f4f744.pdfUniversity of TehranJournal of Algorithms and Computation50120180601Novel Computation of Algorithmic Geometric Series and Summability15115368866ENChinnaraji AnnamalaiIndian Institute of Technology Kharagpur20170829https://jac.ut.ac.ir/article_68866_c35c9a752fb0e8678fbed5678de77932.pdfUniversity of TehranJournal of Algorithms and Computation50120180601Solving a non-linear optimization problem in the presence of Yager-FRE constraints15518368964ENA. GhodousianUniversity of Tehran, College of Engineering, Faculty of Engineering ScienceAbolfazl JavanUniversity of Tehran-
Department of Algorithms and Computation
Tehran-IranAsieh KhoshnoodUniversity of Tehran
Department of Algorihthms and Computation, Tehran, Iran20180112https://jac.ut.ac.ir/article_68964_cc2c1a89bfe91826624e923899270238.pdfUniversity of TehranJournal of Algorithms and Computation50120180601Vertex Switching in 3-Product Cordial Graphs18518868965ENP. JeyanthiPrincipal and Head of the Research Centre,Department of Mathematics,Govindammal Aditanar College for Women,Tiruchendur,Tamilnadu,INDIAA. MaheswariDepartment of Mathematics,
Kamaraj College of Engineering and Technology,
Virudhunagar, India.M. VijayaLakshmiDepartment of Mathematics, Dr.G.U. Pope College of Engineering, Sawyerpuram,Thoothukudi District, Tamil Nadu, India20180123https://jac.ut.ac.ir/article_68965_8b071b3e1293e051be82e794596f567c.pdf