Nilai Ketakteraturan Sisi Total Pada Graf Hasil Kali Comb Pm Dan C5, Serta Subdivisi Pada Hasil Kali Comb P_m Dan C_7
DOI:
https://doi.org/10.26555/konvergensi.v6i2.19550Keywords:
Pelabelan tak teratur sisi, total, hasil kali comb, nilai ketakteraturan sisi total, graf path, graf cycleAbstract
Misalkan  adalah sebuah graf dan  adalah bilangan bulat positif. Pelabelan total pada graf G adalah suatu pemetaan  Bobot titik  dinyatakan  dan bobot sisi  dinyatakan dengan . Suatu pelabelan total dikatakan tak teratur sisi total, jika bobot setiap sisi berbeda. Nilai ketakteraturan sisi total dari graf  dinotasikan dengan tes adalah nilai  minimum atau label terbesar minimum yang digunakan untuk melabeli graf  dengan pelabelan tak teratur sisi total. Penelitian ini diselidiki nilai ketakteraturan sisi total pada graf.References
W. D. Wallis, Magic graphs. Springer Science & Business Media, 2001.
M. BaÄa, M. Miller, and J. Ryan, “On irregular total labellings,†Discrete Math., vol. 307, no. 11–12, pp. 1378–1388, 2007.
C. C. Marzuki, A. N. M. Salman, and M. Miller, “On the total irregularity strength of cycles and paths,†2013.
J. IvanÄo and S. Jendrol, “Total edge irregularity strength of trees,†Discuss. Math. Graph Theory, vol. 26, no. 3, pp. 449–456, 2006.
P. Jeyanthi and A. Sudha, “Total edge irregularity strength of disjoint union of double wheel graphs,†Proyecciones (Antofagasta), vol. 35, no. 3, pp. 251–262, 2016.
M. K. Siddiqui, N. Nurdin, and E. T. Baskoro, “Total Edge Irregularity Strength of the Disjoint Union of Helm Graphs,†J. Math. Fundam. Sci., vol. 45, no. 2, pp. 163–171, 2013.
C. C. Marzuki and R. Riandari, “Nilai Ketakteraturan Total dari Graf Hasil Kali Comb dan,†J. Sains Mat. dan Stat. J. Has. Penelit. Mat. Stat. dan Apl., vol. 3, no. 1, pp. 29–36, 2017.
I. Tarawneh, R. Hasni, and M. A. Asim, “On the edge irregularity strength of disjoint union of star graph and subdivision of star graph.,†Ars Comb., vol. 141, pp. 93–100, 2018.
I. Tarawneh, R. Hasni, and A. Ahmad, “On the edge irregularity strength of corona product of graphs with paths,†Appl. Math. E-Notes, vol. 16, pp. 80–87, 2016.
S. T. Arockiamary, “Total edge irregularity strength of diamond snake and dove,†Int. J. Pure Appl. Math., vol. 109, no. 5, pp. 125–132, 2016.
I. Rosyida and D. Widodo, “On total irregularity strength of caterpillar graphs with two leaves on each internal vertex,†JPhCS, vol. 1008, no. 1, p. 12046, 2018.
I. Rosyida and D. Indriati, “On total edge irregularity strength of some cactus chain graphs with pendant vertices,†in Journal of Physics: Conference Series, 2019, vol. 1211, no. 1, p. 12016.
C. M. Corazon and R. Riyanti, “Nilai Total Ketakteraturan Titik Pada Graf Hasil Kali Comb Pm Dan C5 Dengan m Bilangan Ganjil,†J. Sains Mat. dan Stat. J. Has. Penelit. Mat. Stat. dan Apl., vol. 2, no. 2, pp. 39–47, 2016.
R. Umilasari, “Bilangan dominasi jarak dua pada graf-graf hasil operasi korona dan comb.†Institut Teknologi Sepuluh Nopember, 2015.
B. Bollobás, Modern graph theory, vol. 184. Springer Science & Business Media, 2013.
S. W. Saputro, N. Mardiana, and I. A. Purwasih, “The metric dimension of comb product graphs,†in Graph Theory Conference in Honor of Egawa’s 60th Birthday, September, 2013, vol. 10.
Downloads
Published
Issue
Section
License
Authors who publish with this journal agree to the following terms:
1. Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
2. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this journal.
3. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work.
This work is licensed under a Creative Commons Attribution-ShareAlike 2.0 Generic License.
