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)
One Modulo Three Geometric Mean Graphs

P. Jeyanthi; A. Maheswari; P. Pandiaraj

Volume 50, Issue 1 , June 2018, , Pages 101-108

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

Abstract
  A graph $G$ is said to be one modulo three geometric mean graph if there is an injective function $\phi$ from the vertex set of $G$ to the set $\{a \mid 1\leq a \leq 3q-2\} $ and either $a\equiv 0(mod 3) $ or $ a\equiv 1(mod 3)\}$ where $q$ is the number of edges of $G$ and $\phi$ induces a bijection ...  Read More

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

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