Volume 56 (2024)
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 47 (2016)
Volume 46 (2015)
Volume 45 (2014)
Volume 44 (2013)
Volume 43 (2009)
Volume 42 (2008)
Volume 41 (2007)
Number of Articles: 12
3-difference cordial labeling of some cycle related graphs
Volume 47, Issue 1 , June 2016, Pages 1-10
Abstract
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 MoreA Survey on Complexity of Integrity Parameter
Volume 47, Issue 1 , June 2016, Pages 11-19
Abstract
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 MoreOn Generalized Weak Structures
Volume 47, Issue 1 , June 2016, Pages 21-26
Abstract
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 MoreOnline Scheduling of Jobs for D-benevolent instances On Identical Machines
Volume 47, Issue 1 , June 2016, Pages 27-36
Abstract
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 MoreMixed cycle-E-super magic decomposition of complete bipartite graphs
Volume 47, Issue 1 , June 2016, Pages 37-52
Abstract
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 MoreHeuristic and exact algorithms for Generalized Bin Covering Problem
Volume 47, Issue 1 , June 2016, Pages 53-62
Abstract
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 MoreZarankiewicz Numbers and Bipartite Ramsey Numbers
Volume 47, Issue 1 , June 2016, Pages 63-78
Abstract
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 MoreRandomized Algorithm For 3-Set Splitting Problem and it's Markovian Model
Volume 47, Issue 1 , June 2016, Pages 79-92
Abstract
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 MoreA Cellular Automaton Based Algorithm for Mobile Sensor Gathering
Volume 47, Issue 1 , June 2016, Pages 93-99
Abstract
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 MoreA Mathematical Optimization Model for Solving Minimum Ordering Problem with Constraint Analysis and some Generalizations
Volume 47, Issue 1 , June 2016, Pages 101-117
Abstract
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 MoreThe edge tenacity of a split graph
Volume 47, Issue 1 , June 2016, Pages 119-125
Abstract
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 MoreMinimum Tenacity of Toroidal graphs
Volume 47, Issue 1 , June 2016, Pages 127-135