Article Per Year (5 Year)
p-Index From 2021 - 2026
3.974
P-Index
This Author published in this journals
All Journal AlphaMath: Journal of Mathematics Education EDUKATIF : JURNAL ILMU PENDIDIKAN EIGEN MATHEMATICS JOURNAL Jurnal Penelitian dan Pengkajian Ilmu Pendidikan: e-Saintika Jurnal Ilmiah Profesi Pendidikan Mandalika Mathematics and Educations Journal Griya Journal of Mathematics Education and Application Rengganis Jurnal Pengabdian Masyarakat JES-MAT (Jurnal Edukasi dan Sains Matematika) Jurnal Pijar MIPA Jurnal Riset Pendidikan Matematika Jakarta International Journal of Computing Science and Applied Mathematics-IJCSAM
Junaidi Junaidi
Universitas Mataram
Agriculture, Biological Sciences & Forestry Biochemistry, Genetics & Molecular Biology Chemistry Economics, Econometrics & Finance Education Mathematics Physics Social Sciences Other

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

Found 31 Documents
Search

 1   2   3   4 
Partition Dimension of Bridge Graphs Between Complete and Star Graphs Amrullah Amrullah; Laila Hayati; Junaidi Junaidi
(IJCSAM) International Journal of Computing Science and Applied Mathematics Vol. 11 No. 2 (2025)
Publisher : LPPM Institut Teknologi Sepuluh Nopember

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.12962/j24775401.ijcsam.v11i2.8363

Abstract

This paper investigates the determination of the partition dimension for a \emph{bridge graph} formed by connecting a clique $K_n$ and a star $K_{1,m}$ through a single edge. Although the partition dimension has been extensively studied for various families and graph operations, the mixed dense--sparse case on $B(K_n,K_{1,m})$ remains unsettled, since the result is sensitive to the position of the bridge edge and the balance between the size parameters $n$ and $m$.We combine distance symmetry arguments, leaf-based constraints at the star center, and explicit constructions of distinguishing partitions to obtain tight values of the partition dimension. The study begins with the basic cases $K_1$ and $K_2$, and then proceeds to the general case with parameters $n\ge 2$. The main result shows that for the \emph{central bridge} ($e=v_1x$), it holds that $pd(B)=n-1$ if $m<n$, $pd(B)=n$ if $m=n$, and $pd(B)=m$ if $m>n$; for the \emph{leaf bridge} ($e=v_1u_1$), it holds that $pd(B)=n$ when $m\le n$, and$pd(B)=m-1$ when $m>n$. These results demonstrate that the location of the bridge edge, together with the size parameters $m$ and $n$ of the components, can sharpen the partition dimension value of the graph prior to the bridging operation.
Co-Authors Abdul Haris Munandar Akhmad Asyari Alvi Suciarti Rizqiani Amrullah Amrullah Amrullah Amrullah Arifman S. Haji Dasing Arjudin Arjudin Ayu Lestari Handayani A’ayatul Maulana Baidowi Baidowi Deni Hamdani Dwi Novitasari Eka Kurniawan Fitria Febriani Putri Hapipi Hapipi Harry Soeprianto Herman Firdaus I Nyoman Sridana Ketut Sarjana Khairil Basri Laila Hayati Muhammad Turmuzi Nadia Septina Putri Nani Kurniati Ni Made Ayu Ulandari Nyoman Sridana Pegi Listiani Rosfita Karolina Salsabila, Nilza Humaira Sartika Arifin Sri Subarinah Sripatmi Sripatmi Sudi Prayitno Syahrul Azmi Syamsul Arifin Tabita Wahyu Triutami Trisnowali MS, Andi Ulfa Lu'luilmaknun Ulfa Lu’luilmaknun Wahidaturrahmi, Wahidaturrahmi Warnawati Warnawati Widya Nusywari Wulandari, Nourma Pramestie Yulinar Maulinda Dewi Yulis Tyaningsih, Ratna