Melola Discovery

← Melola Discovery

Jurnal SINTA 1

Total vertex irregularity strength of trees with maximum degree five

Electronic Journal of Graph Theory and Applications · Vol. 6 No. 2 (2018) · hlm. 250–257

DOI
10.5614/ejgta.2018.6.2.5
ISSN
2338-2287
Terbit
2018-10-10
Penerbit
GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB
Bahasa
eng

Abstrak

In 2010, Nurdin, Baskoro, Salman and Gaos conjectured that the total vertex irregularity strength of any tree T is determined only by the number of vertices of degrees 1, 2 and 3 in T. This paper will confirm this conjecture by considering all trees with maximum degree five. Furthermore, we also characterize all such trees having the total vertex irregularity strength either t1, t2 or t3, where $t_{i} = \lceil (1+\sum\sb{j=1}\sp{i}n_{j})/(i+1)\rceil$ and ni is the number of vertices of degree i.

Kata kunci

Jaringan kolaborasi para penulis

16 penulis · 27 tautan kepenulisan bersama

Arahkan kursor atau ketuk sebuah nama untuk menyorot rekan penulisnya. Klik dua kali untuk membuka halaman penulis.

  • University of Indonesia
  • Afiliasi tidak diketahui
  • Organisasi berbeda
  • Organisasi sama
  • Afiliasi tidak diketahui
  • Garis lebih tebal = lebih banyak artikel bersama · lingkaran lebih besar = lebih banyak artikel
Tampilkan sebagai tabel
Rekan penulisOrganisasiArtikel bersama
Kiki Ariyanti SugengUniversity of Indonesia1
Fawwaz Chirag; Combinatorics and Algebra Research Group, Department of Mathematics, Faculty of Mathematics and Natural Sciences, Universitas Indonesia, Indonesia SofyanAfiliasi tidak diketahui1
Syafrizal; Department of Mathematics and Data Science, Faculty of Mathematics and Natural Sciences, Andalas University, Padang, Indonesia SyAfiliasi tidak diketahui1
Nurdin; Graph Theory Research Group, Department of Mathematics, Faculty of Mathematics and Natural Sciences, Hasanuddin University, Indonesia HindingAfiliasi tidak diketahui1
Hilda; Combinatorial Mathematics Research Group, Faculty of Mathematics and Natural Sciences, Institut Teknologi Bandung, Indonesia AssiyatunAfiliasi tidak diketahui1
Maya; Doctoral Program of Mathematics, Faculty of Mathematics and Natural Sciences, Institut Teknologi Bandung NabilaAfiliasi tidak diketahui1
Nobuaki; Graduate School of Information Sciences, Tohoku University, Sendai 980-8579 Japan. ObataAfiliasi tidak diketahui1
Chula Janak; Department of Mathematics, University of Colombo, Colombo, Sri Lanka JayawardeneAfiliasi tidak diketahui1
Lilanthi; Department of Mathematics, University of Colombo, Colombo, Sri Lanka SamarasekaraAfiliasi tidak diketahui1
Syafrizal; Universitas Andalas, Padang, Indonesia SyAfiliasi tidak diketahui1
Anak Agung Gede; Department of Civil Engineering, Universitas Merdeka Malang Indonesia NgurahAfiliasi tidak diketahui1
Shariefuddin; Department of Mathematics, University of Kashmir, Srinagar, Kashmir, India PirzadaAfiliasi tidak diketahui1
Mushtaq; Department of Mathematics, AAAM Degree College, Bemina, Srinagar, India ShahAfiliasi tidak diketahui1

Afiliasi berasal dari OpenAlex; metadata OAI-PMH jurnal tidak memuatnya. Penulis tanpa ID OpenAlex dicocokkan berdasarkan nama, sehingga dua orang bisa tergabung atau satu orang bisa terpisah.

Sumber metadata: OAI-PMH (metadata jurnal) http://www.ejgta.org/index.php/ejgta/oai, pertama di-harvest 8 Nov 2026, terakhir terlihat 8 Nov 2026.
Metadata asli (oai_dc)
<oai_dc:dc xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/  http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">Total vertex irregularity strength of trees with maximum degree five</dc:title>
	<dc:creator>Susilawati, S.; Combinatorial Mathematics Research Group, Faculty of Mathematics and Natural Sciences, 
Institut Teknologi Bandung, Indonesia</dc:creator>
	<dc:creator>Baskoro, Edy Tri; Combinatorial Mathematics Research Group Faculty of Mathematics and Natural Sciences 
Institut Teknologi Bandung, Indonesia</dc:creator>
	<dc:creator>Simanjuntak, Rinovia; Combinatorial Mathematics Research Group Faculty of Mathematics and Natural Sciences 
Institut Teknologi Bandung, Indonesia</dc:creator>
	<dc:subject xml:lang="en-US">irregularity strength, total vertex irregularity strength, tree</dc:subject>
	<dc:description xml:lang="en-US">In 2010, Nurdin, Baskoro, Salman and Gaos conjectured that the total vertex irregularity strength of any tree T is determined only by the number of vertices of degrees 1, 2 and 3 in T. This paper will confirm this conjecture by considering all trees with maximum degree five. Furthermore, we also characterize all such trees having the total vertex irregularity strength either t1, t2 or t3, where $t_{i} = \lceil (1+\sum\sb{j=1}\sp{i}n_{j})/(i+1)\rceil$ and ni is the number of vertices of degree i.</dc:description>
	<dc:publisher xml:lang="en-US">GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB</dc:publisher>
	<dc:contributor xml:lang="en-US">-</dc:contributor>
	<dc:date>2018-10-10</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>http://www.ejgta.org/index.php/ejgta/article/view/415</dc:identifier>
	<dc:identifier>10.5614/ejgta.2018.6.2.5</dc:identifier>
	<dc:source xml:lang="en-US">Electronic Journal of Graph Theory and Applications (EJGTA); Vol 6, No 2 (2018): Electronic Journal of Graph Theory and Applications; 250-257</dc:source>
	<dc:source>2338-2287</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>http://www.ejgta.org/index.php/ejgta/article/view/415/pdf_80</dc:relation>
	<dc:relation>http://www.ejgta.org/index.php/ejgta/article/downloadSuppFile/415/65</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2018 Electronic Journal of Graph Theory and Applications (EJGTA)</dc:rights>
</oai_dc:dc>