Prerak Patel
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Prerak Patel has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Lav Kumar Kaushik
Gujarat Technological University-Institute of Technology and Research, Gujarat, India
1 shared publication U. M. Prajapat
St. Xavier’s College (Autonomous), Ahmedabad 380009, India
1 shared publication- Udayan Prajapati
Department of Mathematics, St. Xavier’s College, Gujarat University, Ahmedabad 380009, India
1 shared publication - Vivek Patel
GTU - Institute of Technology and Research, India
1 shared publication - Yogeshkumar Khimsuriya
Gujarat Technological University-Institute of Technology and Research, Gujarat, India
1 shared publication
Latest Publications
- Open Access
- 1 September 2026
- Published by Atlantis Press SARL
- p. 773-780
Evaluation of Thermal Performance of Solar Air Heater Having Rotating Baffles and Thermal Energy Storage
- 1 September 2026
- Published by Atlantis Press SARL
- p. 773-780
Open AccessEvaluation of Thermal Performance of Solar Air Heater Having Rotating Baffles and Thermal Energy Storage
- 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
- 17 March 2022
- Published by Eleyon Publishers in Journal of Computational Mathematica
- Vol. 6 (1) , 078-090
Sum divisor cordial labeling in the context of graph operations on grötzsch
A Sum divisor cordial labeling of a graph G with vertex set V is a bijection r from V to {1,2,3,...,|V (G )|} such that an edge uv is assigned the label 1 if 2 divides r(u)+ r (v ) and 0 otherwise; and the number of edges labeled with 0 and the number of edges labeled with 1differ by at most 1 . A graph with a sum divisor cordial labeling is called sum divisor cordial graph. In this research paper, we investigate the sum divisor cordial labeling bahevior for Grötzsch graph, fusion of any two vertices in Grötzsch graph, duplication of an arbitrary vertex in Grötzsch graph, duplication of an arbitrary vertex by an edge in Grötzsch graph, switching of an arbitrary vertex of degree four in Grötzsch graph, switching of an arbitrary vertex of degree three in Grötzsch graph and path union of two copies of Grötzsch.
- 17 March 2022
- Published by Eleyon Publishers in Journal of Computational Mathematica
- Vol. 6 (1) , 078-090
Open AccessSum divisor cordial labeling in the context of graph operations on grötzsch
A Sum divisor cordial labeling of a graph G with vertex set V is a bijection r from V to {1,2,3,...,|V (G )|} such that an edge uv is assigned the label 1 if 2 divides r(u)+ r (v ) and 0 otherwise; and the number of edges labeled with 0 and the number of edges labeled with 1differ by at most 1 . A graph with a sum divisor cordial labeling is called sum divisor cordial graph. In this research paper, we investigate the sum divisor cordial labeling bahevior for Grötzsch graph, fusion of any two vertices in Grötzsch graph, duplication of an arbitrary vertex in Grötzsch graph, duplication of an arbitrary vertex by an edge in Grötzsch graph, switching of an arbitrary vertex of degree four in Grötzsch graph, switching of an arbitrary vertex of degree three in Grötzsch graph and path union of two copies of Grötzsch.