Article Per Year (5 Year)
p-Index From 2021 - 2026
2.248
P-Index
This Author published in this journals
All Journal Electronic Journal of Graph Theory and Applications (EJGTA) Journal of Mathematical and Fundamental Sciences Indonesian Journal of Combinatorics Journal La Multiapp Jurnal Locus Penelitian dan Pengabdian
Simanjuntak, Rinovia
Combinatorial Mathematics Research Group, Faculty Of Mathematics And Natural Sciences, Institut Teknologi Bandung
Aerospace Engineering Astronomy Automotive Engineering Chemical Engineering, Chemistry & Bioengineering Chemistry Civil Engineering, Building, Construction & Architecture Computer Science & IT Decision Sciences, Operations Research & Management Earth & Planetary Sciences Electrical & Electronics Engineering Engineering Mathematics Physics

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

Found 21 Documents
Search

 1   2   3 
Modular irregularity strength of vertex amalgamation and comb product path with cycle related graphs Kiki A. Sugeng; Fawwaz Chirag Sofyan; Syafrizal Sy; Nurdin Hinding; Rinovia Simanjuntak
Electronic Journal of Graph Theory and Applications (EJGTA) Vol 14, No 1 (2026): Electronic Journal of Graph Theory and Applications
Publisher : GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.5614/ejgta.2026.14.1.4

Abstract

Consider a graph G = (V(G), E(G)), where V(G) is a nonempty set of vertices and E(G) is a set of edges. Let Zn be the group of integers modulo n, and let k be a positive integer. A modular irregular labeling of a graph G of order n is a k-edge labeling ϕ : E(G) → {1, 2, … , k}, such that an induced weight function wtϕ : V(G) → Zn is bijective. The weight function is defined as follows: wtϕ(u) = Σu ∈ N(v) ϕ(uv) (mod n) for all vertices v in V(G). The minimum value of k is called the modular irregularity strength of G, denoted as ms(G). Suppose G and H are two connected graphs, with G has order n. Vertex amalgamation of graphs G and H is a graph obtained by identifying one vertex from each graph. Suppose that o is a given vertex of H. The comb product of G ▷ H is the graph obtained by taking one copy of G and n copies of H and then attaching the vertex o of the i-th copy of H to the i-th vertex of G. In this paper, we discuss on the exact values of the modular irregularity strength for several graphs such as: vertex amalgamation of cycles; comb product path (or cycle) and cycle and comb product path (or cycle) and regular graphs.
Co-Authors A.N.M. Salman A.N.M. Salman Ali Ahmad Anak Agung Gede Ngurah Anak Agung Gede Ngurah Anam, Juzd Thoha Chairul Andrea Semaničová-Feňovčíková Ashok Gupta Baca, Martin Baskoro, Edy Tri Bety Hayat Susanti Edy Tri Baskoro Faisal Susanto Fawwaz Chirag Sofyan Hassan Pervaiz I Wayan Palton Anuwiksa Kiki A. Sugeng Martin Baca Muchtar, Gatot Mochamad Muzaki, Anggi Afif Nurdin Hinding Pancahayani, Sigit Pancahayani, Sigit Risma Yulina Wulandari Saladin Uttunggadewa Saputro, Suhadi Wido Semanicova-Fenovcıkova, Andrea Suhadi Wido Saputro Susanto, Faisal Susilawati, S. Syafrizal Sy Wulandari, Risma Yulina Yeva Fadhilah Ashari