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 45 (2014)
Volume 44 (2013)
Volume 43 (2009)
Volume 42 (2008)
Volume 41 (2007)
Totally magic cordial labeling of some graphs

P. Jeyanthi; N. Angel Benseera

Volume 46, Issue 1 , December 2015, Pages 1-8

https://doi.org/10.22059/jac.2015.7921

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 More

All Ramsey (2K2,C4)−Minimal Graphs

Kristiana Wijaya; Lyra Yulianti; Edy Tri Baskoro; Hilda Assiyatun; Djoko Suprijanto

Volume 46, Issue 1 , December 2015, Pages 9-25

https://doi.org/10.22059/jac.2015.7922

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 More

Vertex Equitable Labeling of Double Alternate Snake Graphs

P. Jeyanthi; A. Maheswari; M. Vijayalakshmi

Volume 46, Issue 1 , December 2015, Pages 27-34

https://doi.org/10.22059/jac.2016.7923

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 More

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

G. Marimuthu; S. Stalin Kumar

Volume 46, Issue 1 , December 2015, Pages 35-50

https://doi.org/10.22059/jac.2016.7924

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 More

Toughness of the Networks with Maximum Connectivity

D. Moazzami

Volume 46, Issue 1 , December 2015, Pages 51-71

https://doi.org/10.22059/jac.2015.7925

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 More

Further results on total mean cordial labeling of graphs

R. Ponraj; S. Sathish Narayanan

Volume 46, Issue 1 , December 2015, Pages 73-83

https://doi.org/10.22059/jac.2015.7926

Abstract
  A graph G = (V,E) with p vertices and q edges is said to be a total mean cordial graph if there exists a function f : V (G) → {0, 1, 2} such that f(xy) = [(f(x)+f(y))/2] where x, y ∈ V (G), xy ∈ E(G), and the total number of 0, 1 and 2 are balanced. That is |evf (i) ...  Read More