Journal of applied mathematics & informatics

The Korean Society for Computational and Applied Mathematics (한국전산응용수학회)
권호 표지
DOI QR코드

DOI QR Code

GROUP S3 CORDIAL REMAINDER LABELING OF SUBDIVISION OF GRAPHS

  • LOURDUSAMY, A. (Department of Mathematics, St. Xavier's College (Autonomous)) ;
  • WENCY, S. JENIFER (Department of Mathematics, Manonmaniam Sundaranar University) ;
  • PATRICK, F. (Department of Mathematics, St. Xavier's College (Autonomous))
  • Received : 2019.12.02
  • Accepted : 2020.04.08
  • Published : 2020.05.30
Download PDF
⟨ Previous Next ⟩

Abstract

Let G = (V (G), E(G)) be a graph and let g : V (G) → S3 be a function. For each edge xy assign the label r where r is the remainder when o(g(x)) is divided by o(g(y)) or o(g(y)) is divided by o(g(x)) according as o(g(x)) ≥ o(g(y)) or o(g(y)) ≥ o(g(x)). The function g is called a group S3 cordial remainder labeling of G if |vg(i)-vg(j)| ≤ 1 and |eg(1)-eg(0)| ≤ 1, where vg(j) denotes the number of vertices labeled with j and eg(i) denotes the number of edges labeled with i (i = 0, 1). A graph G which admits a group S3 cordial remainder labeling is called a group S3 cordial remainder graph. In this paper, we prove that subdivision of graphs admit a group S3 cordial remainder labeling.

Keywords

References

  1. I. Cahit, Cordial graphs: A weaker version of graceful and harmonious graphs, Ars Combin. 23 (1987), 201-207.
  2. J.A. Gallian, A Dyamic Survey of Graph Labeling, The Electronic J. Combin. 22 (2019), # DS6.
  3. F. Harary, Graph Theory, Addison-wesley, Reading, Mass, 1972.
  4. A. Lourdusamy, S. Jenifer Wency and F. Patrick, Group $S_3$ cordial remainder labeling, International Journal of Recent Technology and Engineering 8 (2019), 8276-8281. https://doi.org/10.35940/ijrte.D8953.118419
  5. A. Lourdusamy, S. Jenifer Wency and F. Patrick, Group $S_3$ cordial remainder labeling for wheel and snake related graphs, (Submitted for Publication).
  6. A. Lourdusamy, S. Jenifer Wency and F. Patrick, Group $S_3$ cordial remainder labeling for path and cycle related graphs, (Submitted for Publication).
  7. A. Lourdusamy, S. Jenifer Wency and F. Patrick, Some Result on Group $S_3$ cordial remainder graphs, (Submitted for Publication).
  8. A. Rosa, On certain valuations of the vertices of a graph, Theory of Graphs, (Internat Sympos., Rome, 1966) New York, Gordon and Breach 1967, 349-355.

Cited by

  1. GROUP S3 CORDIAL REMAINDER LABELING FOR PATH AND CYCLE RELATED GRAPHS vol.39, pp.1, 2020, https://doi.org/10.14317/jami.2021.223