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)
$Z_k$-Magic Labeling of Some Families of Graphs

P. Jeyanthi; K. Jeyadaisy

Volume 50, issue 2 , December 2018, , Pages 1-12

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

Abstract
  For any non-trivial abelian group A under addition a graph $G$ is said to be $A$-\textit{magic}  if there exists a labeling $f:E(G) \rightarrow A-\{0\}$ such that, the vertex labeling $f^+$  defined as $f^+(v) = \sum f(uv)$ taken over all edges $uv$ incident at $v$ is a constant. An $A$-\textit{magic} ...  Read More

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

Vertex Switching in 3-Product Cordial Graphs

P. Jeyanthi; A. Maheswari; M. VijayaLakshmi

Volume 50, Issue 1 , June 2018, , Pages 185-188

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

Abstract
  A mapping  $f: V(G)\rightarrow\left\{0, 1, 2 \right\}$ is called 3-product cordial labeling if $\vert v_f(i)-v_f(j)\vert \leq 1$ and $\vert e_f(i)-e_f(j)\vert \leq 1$ for any $ i, j\in \{0, 1, 2\}$, where $v_f(i)$ denotes the number of vertices labeled  with $i, e_f (i)$ denotes the number ...  Read More

Edge pair sum labeling of some cycle related graphs

P. Jeyanthi; T. Saratha Devi

Volume 48, Issue 1 , December 2016, , Pages 57-68

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

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

Total vertex irregularity strength of corona product of some graphs

P. Jeyanthi; A. Sudha

Volume 48, Issue 1 , December 2016, , Pages 127-140

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

Abstract
  A vertex irregular total k-labeling of a graph G with vertex set V and edge set E is an assignment of positive integer labels {1, 2, ..., k} to both vertices and edges so that the weights calculated at vertices are distinct. The total vertex irregularity strength of G, denoted by tvs(G)is the minimum ...  Read More

On Generalized Weak Structures

R. Jamunarani; P. Jeyanthi; T. Noiri

Volume 47, Issue 1 , June 2016, , Pages 21-26

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

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 More

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

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

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

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