Article Per Year (5 Year)
p-Index From 2021 - 2026
0.444
P-Index
This Author published in this journals
All Journal Jurnal Matematika UNAND International Journal of Computing Science and Applied Mathematics-IJCSAM
Peter John
Universitas Indonesia
Computer Science & IT Mathematics

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

Found 2 Documents
Search

 1 
Restricted Size Ramsey Number for Matching versus Tree and Triangle Unicyclic Graphs of Order Six Elda Safitri; Peter John; Denny Riama Silaban
(IJCSAM) International Journal of Computing Science and Applied Mathematics Vol. 8 No. 1 (2022)
Publisher : LPPM Institut Teknologi Sepuluh Nopember

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

Abstract

Let F, G, and H be simple graphs. The graph F  arrows (G, H) if for any red-blue coloring on the edge of F, we find either a red-colored graph G or a blue-colored graph H in F. The Ramsey number r(G,H) is the smallest positive integer r such that a complete graph Kr arrows (G,H). The restricted size Ramsey number r*(G,H) is the smallest positive integer r* such that there is a graph F, of order r(G,H) and with the size r*, satisfying F arrows (G,H). In this paper we give the restricted size Ramsey number for a matching of two edges versus tree and triangle unicyclic graphs of order six.
Distance Antimagic Labeling for Copies of Graph Peter John; Bonardo Lubis; Kiki Ariyanti Sugeng
Jurnal Matematika UNAND Vol. 15 No. 3 (2026)
Publisher : Departemen Matematika dan Sains Data FMIPA Universitas Andalas Padang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.25077/jmua.15.3.319-324.2026

Abstract

Let G be a graph with vertex set V(G) and edge set E(G). Let f be a bijective function from the vertex set V(G) to the set {1,2,3,... ,|V(G)|} and weight of vertex v in V(G) is the sum of labels of all neighbors of vertex v. If there is no pair of vertices of V(G) have equal weight, then f is called a distance antimagic labeling and G is called a distance antimagic graph. Copies of graph G, denoted as nG is disjoint union of n graphs which each is isomorphic to G. In this paper, we present several results on distance antimagic labeling of copies of graph.
Co-Authors Bonardo Lubis Denny Riama Silaban Elda Safitri Kiki Ariyanti Sugeng