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)
Keywords = path
Number of Articles: 8
Pair difference cordial labeling of planar grid and mongolian tent
Articles in Press, Accepted Manuscript, Available Online from 13 January 2022
Abstract
\noindent Let $G = (V, E)$ be a $(p,q)$ graph.\\Define \begin{equation*}\rho =\begin{cases}\frac{p}{2} ,& \text{if $p$ is even}\\\frac{p-1}{2} ,& \text{if $p$ is odd}\\\end{cases}\end{equation*}\\ and $L = \{\pm1 ,\pm2, \pm3 , \cdots ,\pm\rho\}$ called the set of labels.\\\noindent ... Read More4-TOTAL MEAN CORDIAL LABELING OF SOME TREES
Volume 56, Issue 1 , August 2024, , Pages 44-54
Abstract
Let G be a graph. Let f : V (G) → {0, 1, 2,... ,k − 1}be a function where k ∈ N and k > 1. For each edge uv, assign thelabel f (uv) = lf(u)+f(v)2m. f is called a k-total mean cordial labeling of G if |tmf (i) − tmf (j)| ≤ 1, for all i,j ∈ {0, 1, 2,... ,k − 1},where ... Read MorePair Difference Cordial Labeling of $m-$ copies of Path, Cycle, Star, and Ladder Graphs
Volume 54, Issue 2 , December 2022, , Pages 37-47
Abstract
In this paper, we consider only finite, undirected, and simple graphs. The concept of cordial labeling was introduced by Cahit[4]. Different types of cordial-related labeling were studied in [1, 2, 3, 5, 16]. In a similar line, the notion of pair difference cordial labeling of a graph was introduced ... Read MorePair mean cordial labeling of graphs
Volume 54, Issue 1 , June 2022, , Pages 1-10
Abstract
In this paper, we introduce a new graph labeling called pair mean cordial labeling of graphs. Also, we investigate the pair mean cordiality of some graphs like path, cycle, complete graph, star, wheel, ladder, and comb. Read More$4$-total mean cordial labeling of union of some graphs with the complete bipartite graph $K_{2,n}$
Volume 54, Issue 1 , June 2022, , Pages 35-46
Abstract
Let $G$ be a graph. Let $f:V\left(G\right)\rightarrow \left\{0,1,2,\ldots,k-1\right\}$ be a function where $k\in \mathbb{N}$ and $k>1$. For each edge $uv$, assign the label $f\left(uv\right)=\left\lceil \frac{f\left(u\right)+f\left(v\right)}{2}\right\rceil$. $f$ is called $k$-total mean cordial labeling ... Read MorePair difference cordial labeling of planar grid and mangolian tent
Volume 53, Issue 2 , December 2021, , Pages 47-56
Abstract
Let $G = (V, E)$ be a $(p,q)$ graph.Define \begin{equation*}\rho =\begin{cases}\frac{p}{2} ,& \text{if $p$ is even}\\\frac{p-1}{2} ,& \text{if $p$ is odd}\\\end{cases}\end{equation*}\\ and $L = \{\pm1 ,\pm2, \pm3 , \cdots ,\pm\rho\}$ called the set of labels.\noindent Consider a mapping ... Read MorePD-prime cordial labeling of graphs
Volume 51, Issue 2 , December 2019, , Pages 1-7
Abstract
\vspace{0.2cm} Let $G$ be a graph and $f:V(G)\rightarrow \{1,2,3,.....\left|V(G)\right|\}$ be a bijection. Let $p_{uv}=f(u)f(v)$ and\\ $ d_{uv}= \begin{cases} \left[\frac{f(u)}{f(v)}\right] ~~if~~ f(u) \geq f(v)\\ \\ \left[\frac{f(v)}{f(u)}\right] ~~if~~ f(v) \geq f(u)\\ \end{cases} $\\ for all edge ... Read More$k$-Total prime cordial labeling of graphs
Volume 50, Issue 1 , June 2018, , Pages 143-149