Volume 55 (2023)
Volume 54 (2022)
Volume 53 (2021)
Volume 52 (2020)
Volume 51 (2019)
Volume 50 (2018)
Volume 49 (2017)
Volume 48 (2016)
Volume 46 (2015)
Volume 45 (2014)
Volume 44 (2013)
Volume 43 (2009)
Volume 42 (2008)
Volume 41 (2007)
3-difference cordial labeling of some cycle related graphs

R. Ponraj; M. Maria Adaickalam

Volume 47, Issue 1 , June 2016, Pages 1-10


  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 uv, assign the label |f(u) − f(v)|. The function f is called a k-difference cordial labeling of G if |νf (i) − vf (j)| ≤ 1 and ...  Read More

A Survey on Complexity of Integrity Parameter

Mahmood Shabankhah

Volume 47, Issue 1 , June 2016, Pages 11-19


  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, edgeconnectivity vector, l-connectivity and tenacity. In this paper we discuss Integrity ...  Read More

On Generalized Weak Structures

R. Jamunarani; P. Jeyanthi; T. Noiri

Volume 47, Issue 1 , June 2016, Pages 21-26


  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),π(g),σ(g) and β (g). This work is a further investigation of generalized weak structures due ...  Read More

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

I. Mohammadi; Dara Moazzami

Volume 47, Issue 1 , June 2016, Pages 27-36


  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 immediately be scheduled on a machine or it will be rejected. It is also allowed during execution ...  Read More

Mixed cycle-E-super magic decomposition of complete bipartite graphs

G. Marimuthu; S. Stalin Kumar

Volume 47, Issue 1 , June 2016, Pages 37-52


  An H-magic labeling in a H-decomposable graph G is a bijection f : V (G) ∪ E(G) → {1, 2, ..., p + q} such that for every copy H in the decomposition, ΣνεV(H) f(v) +  ΣeεE(H) f(e) is constant. f is said to be H-E-super magic if f(E(G)) = {1, 2, · ...  Read More

Heuristic and exact algorithms for Generalized Bin Covering Problem

S. Jabari; Dara Moazzami; A. Ghodousian

Volume 47, Issue 1 , June 2016, Pages 53-62


  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 instances, a heuristic algorithm has been proposed. By computational experiments, the ...  Read More

Zarankiewicz Numbers and Bipartite Ramsey Numbers

Alex F. Collins; Alexander W. N. Riasanovsky; John C. Wallace; Stanis law P. Radziszowski

Volume 47, Issue 1 , June 2016, Pages 63-78


  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. The two-color bipartite Ramsey number b(s, t) is the smallest integer b such that any coloring of the edges of Kb,b with two colors contains a Ks,s in the rst color or ...  Read More

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

Mahdi Heidari; Ali Golshani; D. Moazzami; Ali Moeini

Volume 47, Issue 1 , June 2016, Pages 79-92


  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 problem to 3-set splitting. Then we introduce a randomize algorithm, and we ...  Read More

A Cellular Automaton Based Algorithm for Mobile Sensor Gathering

S. Saadatmand; D. Moazzami; A. Moeini

Volume 47, Issue 1 , June 2016, Pages 93-99


  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 deployed in the network and goal is gather all sensors into one location. The sensors ...  Read More

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

Samira Rezaei; Amin Ghodousian

Volume 47, Issue 1 , June 2016, Pages 101-117


  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 analyzed with the emphasis on the assessment of their importance in the formulation. ...  Read More

The edge tenacity of a split graph

Bahareh Bafandeh Mayvan

Volume 47, Issue 1 , June 2016, Pages 119-125


  The edge tenacity Te(G) of a graph G is de ned as:Te(G) = min {[|X|+τ(G-X)]/[ω(G-X)-1]|X ⊆ E(G) and ω(G-X) > 1} where the minimum is taken over every edge-cutset X that separates G into ω(G - X) components, and by τ(G - X) we denote the order of a ...  Read More

Minimum Tenacity of Toroidal graphs

Hamid Doost Hosseini

Volume 47, Issue 1 , June 2016, Pages 127-135


  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 all vertex cutsets S of G. We de ne τ(G - S) to be the number of the vertices in the largest component of the graph G - S, and ω(G - S) be the number of components of G ...  Read More