Article Per Year (5 Year)
p-Index From 2021 - 2026
0.23
P-Index
This Author published in this journals
All Journal Jurnal Matematika Jurnal Ekonomi dan Kebijakan Publik Indonesia
Nisa Erma Fitriana
Unknown Affiliation
Economics, Econometrics & Finance Mathematics

Published : 2 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search
Journal : Jurnal Matematika

 1 
PELABELAN CORDIAL UNTUK GRAF SPLIT DARI BEBERAPA GRAF Nisa Erma Fitriana; Lucia Ratnasari
Jurnal Matematika Vol 1, No 1 (2012): jurnal matematika
Publisher : MATEMATIKA FSM, UNDIP

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Cordial labeling is a binary point labeling that have absolute value condition of the difference in the number of vertices having label 0 and the number of vertices having label 1 is less than or equal to 1 dan absolute value of the difference in  the number of edges having label 0 and the number of edges having label 1 is less than or equal to 1. Graph which qualified of cordial labeling is called cordial graph. Split graph S(G) is the graph obtained by taking a new vertex v’ for each vertex v of a graph G , a new vertex v’ is connected to all vertices of G which adjacent to v . In this final paper explored about cordial labeling for split graph of path graph, cycle graph, wheel graph, matching graph, fan graph, bipartite complete graph, and k copies star graph
Co-Authors Lucia Ratnasari Qibthiyyah, Riatu Mariatul