Article Per Year (5 Year)
p-Index From 2019 - 2024
0.408
P-Index
This Author published in this journals
All Journal International Journal of Computing Science and Applied Mathematics Indonesian Journal of Combinatorics
Fawwaz Fakhrurrozi Hadiputra
Institut Teknologi Bandung
Computer Science & IT Decision Sciences, Operations Research & Management Education Mathematics

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

Found 2 Documents
Search

 1 
On Ramsey (mK2,bPn)-minimal Graphs Nadia Nadia; Lyra Yulianti; Fawwaz Fakhrurrozi Hadiputra
Indonesian Journal of Combinatorics Vol 7, No 1 (2023)
Publisher : Indonesian Combinatorial Society (InaCombS)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.19184/ijc.2023.7.1.2

Abstract

Let G and H be two given graphs. The notation F→(G,H) means that any red-blue coloring on the edges of F will create either a red subgraph G or a blue subgraph H in F. A graph F is a Ramsey (G,H)-minimal graph if F satisfies two conditions: (1) F→(G,H), and (2) (F−e) ⇸ (G,H) for every e ∈ E(F). Denote ℜ(G,H) as the set of all (G,H)-minimal graphs. In this paper we prove that a tree T is not in ℜ(mK2,bPn) if it has a diameter of at least n(b+m−1)−1 for m,n,b≥2, furthermore we show that (b+m−1)Pn ∈ ℜ(mK2,bPn) for every m,n,b≥2. We also prove that for n≥3, a cycle on k vertices is in ℜ(mK2,bPn) if and only if k ∈ [n(b+m−2)+1, n(b+m−1)−1].
Further Results on Ph-supermagic Trees Tita Khalis Maryati; Otong Suhyanto; Fawwaz Fakhrurrozi Hadiputra
(IJCSAM) International Journal of Computing Science and Applied Mathematics Vol 9, No 2 (2023)
Publisher : Institut Teknologi Sepuluh Nopember

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.12962/j24775401.v9i2.15087

Abstract

Let $G$ be a simple, finite, and undirected graph. An $H$-supermagic labeling is a bijective map $f : V(G) \cup E(G) \to \{1,2,\cdots,|V(G)|+|E(G)|\}$ in which $f(V) = \{1,2,\cdots,|V(G)|\}$ and there exists an integer $m$ such that $w(H') = \sum_{v  \in V(H')} f(v) + \sum_{e \in E(H')} f(e) = m$, for every subgraph $H' \cong H$ in $G$. In this paper, we determine some classes of trees which have $P_h$-supermagic labeling.
Co-Authors Nadia Nadia SUHYANTO, OTONG Tita Khalis Maryati Yulianti, Lyra