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: 6
Totally magic cordial labeling of some graphs
Volume 46, Issue 1 , December 2015, Pages 1-8
Abstract
A graph G is said to have a totally magic cordial labeling with constant C if there exists a mapping f : V (G) ∪ E(G) → {0, 1} such that f(a) + f(b) + f(ab) ≡ C (mod 2) for all ab ∈ E(G) and |nf (0) − nf (1)| ≤ 1, where nf (i) (i = 0, 1) is the sum of ... Read MoreAll Ramsey (2K2,C4)−Minimal Graphs
Volume 46, Issue 1 , December 2015, Pages 9-25
Abstract
Let F, G and H be non-empty graphs. The notation F → (G,H) means that if any edge of F is colored by red or blue, then either the red subgraph of F con- tains a graph G or the blue subgraph of F contains a graph H. A graph F (without isolated vertices) is called a Ramsey ... Read MoreVertex Equitable Labeling of Double Alternate Snake Graphs
Volume 46, Issue 1 , December 2015, Pages 27-34
Abstract
Let G be a graph with p vertices and q edges and A = {0, 1, 2, . . . , [q/2]}. A vertex labeling f : V (G) → A induces an edge labeling f∗ defined by f∗(uv) = f(u) + f(v) for all edges uv. For a ∈ A, let vf (a) be the number of vertices v with f(v) = a. A ... Read MoreMixed cycle-E-super magic decomposition of complete bipartite graphs
Volume 46, Issue 1 , December 2015, Pages 35-50
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 (H) f(e) is constant. f is said to be H-E-super magic if f(E(G)) = ... Read MoreToughness of the Networks with Maximum Connectivity
Volume 46, Issue 1 , December 2015, Pages 51-71
Abstract
The stability of a communication network composed of processing nodes and communication links is of prime importance to network designers. As the network begins losing links or nodes, eventually there is a loss in its effectiveness. Thus, communication networks must be constructed ... Read MoreFurther results on total mean cordial labeling of graphs
Volume 46, Issue 1 , December 2015, Pages 73-83