Melola Discovery

← Melola Discovery

Akses terbuka Jurnal SINTA 3

CENTRALITY MEASURES ON BRINKMANN GRAPH: BEFORE AND AFTER NODE DELETION

BAREKENG: Jurnal Ilmu Matematika dan Terapan · Vol. 16 No. 3 (2022) · hlm. 1097–1104

DOI
10.30598/barekengvol16iss3pp1097-1104
ISSN
2615-3017, 1978-7227
Terbit
2022-09-01
Penerbit
PATTIMURA UNIVERSITY
Bahasa
eng
Lisensi
creativecommons.org/licenses/by-sa/4.0

Abstrak

Brinkmann graph is a 4-regular graph with 21 nodes and 42 edges discovered by Gunnar Brinkmann in 1992. To our knowledge, the research specifically on Brinkmann graph is still hard to find. Therefore, this research was carried out to analyze the Brinkmann graph in term of its centrality. The centrality measures used are degree, betweenness, and closeness centrality. In this paper, we presented the centrality measures not only on the Brinkmann graph but also on the Brinkmann graph after node deletion to see how the impact of node deletion to the centrality of graph. Before deletion, the results showed that according to the betweenness centrality, there exist 7 nodes who act as mediators or bridges in the Brinkmann graph. Therefore, when a node among these nodes has deleted, it affected not only any other mediator nodes and the furthest nodes from the deleted node but also the nodes that are adjacent to the deleted nodes.

Jaringan kolaborasi para penulis

Belum ada rekan penulis di Melola.

Sumber metadata: OAI-PMH (metadata jurnal) https://ojs3.unpatti.ac.id/index.php/barekeng/oai, pertama di-harvest 5 Nov 2026, terakhir terlihat 15 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">CENTRALITY MEASURES ON BRINKMANN GRAPH:  BEFORE AND AFTER NODE DELETION</dc:title>
	<dc:creator>Masrurotullaily, Masrurotullaily</dc:creator>
	<dc:description xml:lang="en-US">Brinkmann graph is a 4-regular graph with 21 nodes and 42 edges discovered by Gunnar Brinkmann in 1992. To our knowledge, the research specifically on Brinkmann graph is still hard to find. Therefore, this research was carried out to analyze the Brinkmann graph in term of its centrality. The centrality measures used are degree, betweenness, and closeness centrality. In this paper, we presented the centrality measures not only on the Brinkmann graph but also on the Brinkmann graph after node deletion to see how the impact of node deletion to the centrality of graph. Before deletion, the results showed that according to the betweenness centrality, there exist 7 nodes who act as mediators or bridges in the Brinkmann graph. Therefore, when a node among these nodes has deleted, it affected not only any other mediator nodes and the furthest nodes from the deleted node but also the nodes that are adjacent to the deleted nodes.</dc:description>
	<dc:publisher xml:lang="en-US">PATTIMURA UNIVERSITY</dc:publisher>
	<dc:date>2022-09-01</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ojs3.unpatti.ac.id/index.php/barekeng/article/view/6436</dc:identifier>
	<dc:identifier>10.30598/barekengvol16iss3pp1097-1104</dc:identifier>
	<dc:source xml:lang="en-US">BAREKENG: Jurnal Ilmu Matematika dan Terapan; Vol 16 No 3 (2022): BAREKENG: Journal of Mathematics and Its Applications; 1097-1104</dc:source>
	<dc:source>2615-3017</dc:source>
	<dc:source>1978-7227</dc:source>
	<dc:source>10.30598/barekengvol16iss3year2022</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ojs3.unpatti.ac.id/index.php/barekeng/article/view/6436/4634</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2022 Masrurotullaily Masrurotullaily</dc:rights>
	<dc:rights xml:lang="en-US">http://creativecommons.org/licenses/by-sa/4.0</dc:rights>
</oai_dc:dc>