Pelabelan C-Cordial pada Graf Bertanda
Delia Noor Mavianti, Uha Isnaini, S.Si., M.Sc., Ph.D.
2026 | Skripsi | MATEMATIKA
Diberikan graf sederhana dan tak berarah G = (V (G),E(G)). Pelabelan C-cordial pada graf bertanda merupakan fungsi penandaan titik berdasarkan canonical marking (C-marking) dari sisi-sisi insidennya sedemikian sehingga selisih jumlah titik bertanda positif dan negatif, serta selisih jumlah sisi bertanda positif dan negatif, keduanya tidak lebih dari satu. Penelitian ini menyelidiki kondisi nilai n tertentu pada lintasan bertanda dan siklus bertanda agar bersifat C-cordial, menganalisis perubahan sifat graf akibat operasi negasi, dan memberikan bukti formal untuk konfigurasi section yang memenuhi syarat C-cordial.
Given a simple undirected graph G = (V (G),E(G)). A C-cordial labeling on a signed graph is a vertex-marking function based on the canonical marking (C-marking) of its incident edges such that the absolute difference between the number of positively and negatively signed vertices, as well as the absolute difference between the number of positively and negatively signed edges, are both at most one. This study investigates the conditions for specific values of n under which signed paths and signed cycles are C-cordial, analyzes the changes in graph properties resulting from the negation operation, and provides formal proofs for the section configurations that satisfy the C-cordiality condition.
Kata Kunci : Cordial labeling, Signed graph