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 44 (2013)
Volume 43 (2009)
Volume 42 (2008)
Volume 41 (2007)
Skolem Odd Difference Mean Graphs

P. Jeyanthi; D. Ramya; R. Kalaiyarasi

Volume 45, Issue 1 , December 2014, Pages 1-12

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

Abstract
  In this paper we define a new labeling called skolem odd difference mean labeling and investigate skolem odd difference meanness of some standard graphs. Let G = (V,E) be a graph with p vertices and q edges. G is said be skolem odd difference mean if there exists a function f : V (G) → {0, 1, 2, 3, ...  Read More

Three Graceful Operations

Sarah Minion; Christian Barrientos

Volume 45, Issue 1 , December 2014, Pages 13-24

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

Abstract
  A graph of size n is said to be graceful when is possible toassign distinct integers from {0, 1, . . . , n} to its verticesand {|f(u)−f(v)| : uv ∈ E(G)} consists of n integers. Inthis paper we present broader families of graceful graphs; these families are obtained via three different operations: ...  Read More

Edge pair sum labeling of spider graph

P. Jeyanthi; T. Saratha Devi

Volume 45, Issue 1 , December 2014, Pages 25-34

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

Abstract
  An injective map f : E(G) → {±1, ±2, · · · , ±q} is said to be an edge pair sum labeling of a graph G(p, q) if the induced vertex function f*: V (G) → Z − {0} defined by f*(v) = (Sigma e∈Ev) f (e) is one-one, where Ev denotes the set of edges in G that are incident with a vetex v and f*(V ...  Read More

The Mean Labeling of Some Crowns

M. E. Abdel-Aal; S. Minion; C. Barrientos; D. Williams

Volume 45, Issue 1 , December 2014, Pages 43-54

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

Abstract
  Mean labelings are a type of additive vertex labeling. This labeling assigns non-negative integers to the vertices of a graph in such a way that all edge-weights are different, where the weight of an edge is defined as the mean of the end-vertex labels rounded up to the nearest integer. In this paper ...  Read More