Udayan Prajapati
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Udayan Prajapati has a total of 3 co-authors. Here are the top co-authors by number of shared publications:
- Anit Vantiya
Gujarat University
1 shared publication - Kishan Vyas
Department of Mathematics, Gujarat University
1 shared publication - Prerak Patel
Department of Mathematics, Gujarat University, Ahmedabad 380009, Gujrat, India
1 shared publication
Latest Publications
- Open Access
- 24 May 2024
- Published by RGN Publications in Communications in Mathematics and Applications
- Vol. 15 (1) , 417-429
Product Binary L-Cordial Labeling of Various Degree Splitting Graphs
This study examines the probability of the degree splitting operation results from various graphs being product binary \(L\)-cordial graphs. The graphs under investigation include the path graph \((P_{n})\), comb graph \((P_{n}\odot k_{1})\), double comb graph \((P_{n}\odot 2k_{1})\), cycle graph \((C_{n})\), shell graph \((S_{n})\) and ladder graph \((L_{n})\). The application of product binary \(L\)-cordial labelling demonstrates that these analyzed graphs exhibit characteristics of product binary \(L\)-cordial graphs.- 24 May 2024
- Published by RGN Publications in Communications in Mathematics and Applications
- Vol. 15 (1) , 417-429
Open AccessProduct Binary L-Cordial Labeling of Various Degree Splitting Graphs
This study examines the probability of the degree splitting operation results from various graphs being product binary \(L\)-cordial graphs. The graphs under investigation include the path graph \((P_{n})\), comb graph \((P_{n}\odot k_{1})\), double comb graph \((P_{n}\odot 2k_{1})\), cycle graph \((C_{n})\), shell graph \((S_{n})\) and ladder graph \((L_{n})\). The application of product binary \(L\)-cordial labelling demonstrates that these analyzed graphs exhibit characteristics of product binary \(L\)-cordial graphs. - Open Access
- 21 January 2024
- Published by Universidad Catolica del Norte - Chile in Proyecciones (Antofagasta)
- Vol. 43 (1) , 41-51
Nourishing Number of Some Associated Graphs
Let N0 = N∪{0} and P(N0) be the power set. An injection f : V (G) → P(N0) is an integer additive set-indexer (IASI) of a graph G if the induced map f+ : E(G) → P(N0) given by f+(uv) = f(u) + f(v) is also an injection, where f(u) + f(v) is the sumset of f(u) and f(v). Moreover, if |f+(uv)| = |f(u)| |f(v)|, for all uv in E(G), then f is a strong IASI of G. The nourishing number of a graph G is the minimum order of the maximal complete subgraph of G such that G admits a strong IASI. In this paper we investigate the admissibility of strong IASI for some associated graphs and calculate their nourishing number. In addition, we obtain the nourishing number of powers of the associated graphs.
- 21 January 2024
- Published by Universidad Catolica del Norte - Chile in Proyecciones (Antofagasta)
- Vol. 43 (1) , 41-51
Open AccessNourishing Number of Some Associated Graphs
Let N0 = N∪{0} and P(N0) be the power set. An injection f : V (G) → P(N0) is an integer additive set-indexer (IASI) of a graph G if the induced map f+ : E(G) → P(N0) given by f+(uv) = f(u) + f(v) is also an injection, where f(u) + f(v) is the sumset of f(u) and f(v). Moreover, if |f+(uv)| = |f(u)| |f(v)|, for all uv in E(G), then f is a strong IASI of G. The nourishing number of a graph G is the minimum order of the maximal complete subgraph of G such that G admits a strong IASI. In this paper we investigate the admissibility of strong IASI for some associated graphs and calculate their nourishing number. In addition, we obtain the nourishing number of powers of the associated graphs.
- Open Access
- 27 April 2021
- Published by Universidad Catolica del Norte - Chile in Proyecciones (Antofagasta)
- Vol. 40 (3) , 619-634
SD-prime cordial labeling of alternate k-polygonal snake of various types
Let f : V (G) → {1, 2,..., |V (G)|} be a bijection, and let us denote S = f(u) + f(v) and D = |f(u) − f(v)| for every edge uv in E(G). Let f' be the induced edge labeling, induced by the vertex labeling f, defined as f' : E(G) → {0, 1} such that for any edge uv in E(G), f' (uv)=1 if gcd(S, D)=1, and f' (uv)=0 otherwise. Let ef' (0) and ef' (1) be the number of edges labeled with 0 and 1 respectively. f is SD-prime cordial labeling if |ef' (0) − ef' (1)| ≤ 1 and G is SD-prime cordial graph if it admits SD-prime cordial labeling. In this paper, we have discussed the SD-prime cordial labeling of alternate k-polygonal snake graphs of type-1, type-2 and type-3.
- 27 April 2021
- Published by Universidad Catolica del Norte - Chile in Proyecciones (Antofagasta)
- Vol. 40 (3) , 619-634
Open AccessSD-prime cordial labeling of alternate k-polygonal snake of various types
Let f : V (G) → {1, 2,..., |V (G)|} be a bijection, and let us denote S = f(u) + f(v) and D = |f(u) − f(v)| for every edge uv in E(G). Let f' be the induced edge labeling, induced by the vertex labeling f, defined as f' : E(G) → {0, 1} such that for any edge uv in E(G), f' (uv)=1 if gcd(S, D)=1, and f' (uv)=0 otherwise. Let ef' (0) and ef' (1) be the number of edges labeled with 0 and 1 respectively. f is SD-prime cordial labeling if |ef' (0) − ef' (1)| ≤ 1 and G is SD-prime cordial graph if it admits SD-prime cordial labeling. In this paper, we have discussed the SD-prime cordial labeling of alternate k-polygonal snake graphs of type-1, type-2 and type-3.