ON LEGENDRE ABSOLUTE DIFFERENCE CORDIAL LABELING OF SOME SPECIAL GRAPHS

Abstract: Cahit originally proposed the premise of cordial labelling in 1987. Legendre Cordial Labelling initially emerged by Jason D. Andoyo & F. Rulete in 2025. Inspired by this effort, we designed Legendre Absolute Difference Cordial Labelling. A bijection is typically referred to as a Legendre absolute difference cordial labelling modulo , wherein constitutes an odd prime, assuming as basic connected graph while the resultant map laid out as if or , & if or , whence , , fulfills the condition whence remains the count of labelled edges . The analysis of Legendre absolute difference cordial labelling modulo for certain networks, such as Y-tree graph, F- tree graph, Triangular snake graph and Trianglar book graph. Keywords: Legendre absolute difference cordial Y-tree, F- tree graph, Triangular snake graph and Trianglar book graph. Title: ON LEGENDRE ABSOLUTE DIFFERENCE CORDIAL LABELING OF SOME SPECIAL GRAPHS Author: R. Anusuya, G. Priscilla Pacifica International Journal of Mathematics and Physical Sciences Research ISSN 2348-5736 (Online) Vol. 14, Issue 1, April 2026 - September 2026 Page No: 150-155 Research Publish Journals Website: www.researchpublish.com Published Date: 10-September-2026 DOI: https://doi.org/10.5281/zenodo.22687855 Paper Download Link (Source) https://www.researchpublish.com/papers/on-legendre-absolute-difference-cordial-labeling-of-some-special-graphs

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-09-10
DOI
https://doi.org/10.5281/zenodo.22687855
Primary Topic
Graph Labeling and Dimension Problems
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

ON LEGENDRE ABSOLUTE DIFFERENCE CORDIAL LABELING OF SOME SPECIAL GRAPHS

G. Priscilla Pacifica, R. Anusuya
Zenodo (CERN European Organization for Nuclear Research)
Graph Labeling and Dimension Problems
article

ON LEGENDRE ABSOLUTE DIFFERENCE CORDIAL LABELING OF SOME SPECIAL GRAPHS

G. Priscilla Pacifica, R. Anusuya
article en

Abstract

Abstract: Cahit originally proposed the premise of cordial labelling in 1987. Legendre Cordial Labelling initially emerged by Jason D. Andoyo & F. Rulete in 2025. Inspired by this effort, we designed Legendre Absolute Difference Cordial Labelling. A bijection is typically referred to as a Legendre absolute difference cordial labelling modulo , wherein constitutes an odd prime, assuming as basic connected graph while the resultant map laid out as if or , & if or , whence , , fulfills the condition whence remains the count of labelled edges . The analysis of Legendre absolute difference cordial labelling modulo for certain networks, such as Y-tree graph, F- tree graph, Triangular snake graph and Trianglar book graph. Keywords: Legendre absolute difference cordial Y-tree, F- tree graph, Triangular snake graph and Trianglar book graph. Title: ON LEGENDRE ABSOLUTE DIFFERENCE CORDIAL LABELING OF SOME SPECIAL GRAPHS Author: R. Anusuya, G. Priscilla Pacifica International Journal of Mathematics and Physical Sciences Research ISSN 2348-5736 (Online) Vol. 14, Issue 1, April 2026 - September 2026 Page No: 150-155 Research Publish Journals Website: www.researchpublish.com Published Date: 10-September-2026 DOI: https://doi.org/10.5281/zenodo.22687855 Paper Download Link (Source) https://www.researchpublish.com/papers/on-legendre-absolute-difference-cordial-labeling-of-some-special-graphs

Zenodo (CERN European Organization for Nuclear Research)
Openalex Percentile: Top 8%
Graph Labeling and Dimension Problems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.