مرور Volume 47, Issue 1 بر اساس عنوان

در حال نمایش موارد 1 - 11 از 11

  • 3-difference cordial labeling of some cycle related graphs 

    Ponraj, R.؛ Maria Adaickalam, M. (University of Tehran, 2016-06-01)
    Let G be a (p, q) graph. Let k be an integer with 2 ≤ k ≤ p and f from V (G) to the set {1, 2, . . . , k} be a map. For each edge ...

  • A Cellular Automaton Based Algorithm for Mobile Sensor Gathering 

    Saadatmand, S.؛ Moazzami, D.؛ Moeini, A. (University of Tehran, 2016-06-01)
    In this paper we proposed a Cellular Automaton based local algorithm to solve the autonomously sensor gathering problem in Mobile Wireless Sensor Networks (MWSN). In this problem initially the connected mobile sensors ...

  • The edge tenacity of a split graph 

    Bafandeh Mayvan, Bahareh (University of Tehran, 2016-06-01)
    The edge tenacity Te(G) of a graph G is de ned as:Te(G) = min {[|X|+τ(G-X)]/[ω(G-X)-1]|X

  • Heuristic and exact algorithms for Generalized Bin Covering Problem 

    Jabari, S.؛ Moazzami, Dara؛ Ghodousian, A. (University of Tehran, 2016-06-01)
    In this paper, we study the Generalized Bin Covering problem. For this problem an exact algorithm is introduced which can nd optimal solution for small scale instances. To nd a solution near optimal for large scale ...

  • A Mathematical Optimization Model for Solving Minimum Ordering Problem with Constraint Analysis and some Generalizations 

    Rezaei, Samira؛ Ghodousian, Amin (University of Tehran, 2016-06-01)
    In this paper, a mathematical method is proposed to formulate a generalized ordering problem. This model is formed as a linear optimization model in which some variables are binary. The constraints of the problem have been ...

  • Minimum Tenacity of Toroidal graphs 

    Doost Hosseini, Hamid (University of Tehran, 2016-06-01)
    The tenacity of a graph G, T(G), is de ned by T(G) = min{[|S|+τ(G-S)]/[ω(G-S)]}, where the minimum is taken over ...

  • On Generalized Weak Structures 

    Jamunarani, R.؛ Jeyanthi, P.؛ Noiri, T. (University of Tehran, 2016-06-01)
    Avila and Molina [1] introduced the notion of generalized weak structures which naturally generalize minimal structures, generalized topologies and weak structures and the structures α (g),π ...

  • Online Scheduling of Jobs for D-benevolent instances On Identical Machines 

    Mohammadi, I.؛ Moazzami, Dara (University of Tehran, 2016-06-01)
    We consider online scheduling of jobs with speci c release time on m identical machines. Each job has a weight and a size; the goal is maximizing total weight of completed jobs. At release time of a job it must ...

  • Randomized Algorithm For 3-Set Splitting Problem and it's Markovian Model 

    Heidari, Mahdi؛ Golshani, Ali؛ Moazzami, D.؛ Moeini, Ali (University of Tehran, 2016-06-01)
    In this paper we restrict every set splitting problem to the special case in which every set has just three elements. This restricted version is also NP-complete. Then, we introduce a general conversion from any set splitting ...

  • A Survey on Complexity of Integrity Parameter 

    Shabankhah, Mahmood (University of Tehran, 2016-06-01)
    Many graph theoretical parameters have been used to describe the vulnerability of communication networks, including toughness, binding number, rate of disruption, neighbor-connectivity, integrity, mean integrity, ...

  • Zarankiewicz Numbers and Bipartite Ramsey Numbers 

    Collins, Alex F.؛ Riasanovsky, Alexander W. N.؛ Wallace, John C.؛ Radziszowski, Stanis law P. (University of Tehran, 2016-06-01)
    The Zarankiewicz number z(b; s) is the maximum size of a subgraph of Kb,b which does not contain Ks,s as a subgraph. ...