Melola Discovery

← Melola Discovery

Open access Jurnal SINTA 3

CONSTRUCTION OF BICYCLIC GRAPH AND ITS APPLICATION IN TRANS JOGJA ROUTES

BAREKENG: Jurnal Ilmu Matematika dan Terapan · Vol. 17 No. 4 (2023) · pp. 2095–2106

DOI
10.30598/barekengvol17iss4pp2095-2106
ISSN
2615-3017, 1978-7227
Published
2023-12-19
Publisher
PATTIMURA UNIVERSITY
Language
eng
License
creativecommons.org/licenses/by-sa/4.0

Abstract

A bicyclic graph is a type of graph that consists of exactly two cycles. A cycle is a graph that is a closed path where no vertices are repeated except the first and last vertices which are the same. The cycles in bicyclic graph can be of different lengths and shapes, but they must have at least one common vertex. Bicyclic graphs can be divided into two categories based on the types of induced subgraphs they contain. One category consists of graphs that include an -graph as an induced subgraph, while the other category comprises graphs that contain a -graph as an induced subgraph. There are 3 types of bicyclic graph without pendant vertex. A directed graph, also referred to as a digraph, is a graph in which each edge is assigned a specific direction. A directed bicyclic graph is a special kind of directed graph that contains precisely two distinct directed cycles. This graph can be applied in transportation problem. In this article, we give some examples of directed bicyclic graph in Trans Jogja routes.

Collaboration network of the authors

8 authors · 12 co-authorship links

Hover or tap a name to highlight its co-authors. Double-click to open the author's page.

  • Affiliation unknown
  • Different organisations
  • Same organisation
  • Affiliation unknown
  • Thicker line = more joint articles · bigger circle = more articles
Show as table
Co-authorOrganisationJoint articles
Sobri AbusiniAffiliation unknown3
Ni Kadek Emik SapitriAffiliation unknown1
Ardi Nur HidayatAffiliation unknown1
Abdul Rouf AlghofariAffiliation unknown1
Noor HidayatAffiliation unknown1
Desfi Rahmatul KhairiAffiliation unknown1

Affiliations come from OpenAlex; journal OAI-PMH metadata carries none. Authors without an OpenAlex ID are matched by name, which can merge or split people.

Metadata source: OAI-PMH (metadata jurnal) https://ojs3.unpatti.ac.id/index.php/barekeng/oai, first harvested 5 Nov 2026, last seen 5 Nov 2026.
Original metadata (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">CONSTRUCTION OF BICYCLIC GRAPH AND ITS APPLICATION IN TRANS JOGJA ROUTES</dc:title>
	<dc:creator>Ambarwati, Aditya</dc:creator>
	<dc:creator>Krisnawati, Vira Hari</dc:creator>
	<dc:description xml:lang="en-US">A bicyclic graph is a type of graph that consists of exactly two cycles. A cycle is a graph that is a closed path where no vertices are repeated except the first and last vertices which are the same. The cycles in bicyclic graph can be of different lengths and shapes, but they must have at least one common vertex. Bicyclic graphs can be divided into two categories based on the types of induced subgraphs they contain. One category consists of graphs that include an  -graph as an induced subgraph, while the other category comprises graphs that contain a  -graph as an induced subgraph. There are 3 types of bicyclic graph without pendant vertex. A directed graph, also referred to as a digraph, is a graph in which each edge is assigned a specific direction. A directed bicyclic graph is a special kind of directed graph that contains precisely two distinct directed cycles. This graph can be applied in transportation problem. In this article, we give some examples of directed bicyclic graph in Trans Jogja routes.</dc:description>
	<dc:publisher xml:lang="en-US">PATTIMURA UNIVERSITY</dc:publisher>
	<dc:date>2023-12-19</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/9570</dc:identifier>
	<dc:identifier>10.30598/barekengvol17iss4pp2095-2106</dc:identifier>
	<dc:source xml:lang="en-US">BAREKENG: Jurnal Ilmu Matematika dan Terapan; Vol 17 No 4 (2023): BAREKENG: Journal of Mathematics and Its Applications; 2095-2106</dc:source>
	<dc:source>2615-3017</dc:source>
	<dc:source>1978-7227</dc:source>
	<dc:source>10.30598/barekengvol17iss4year2023</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ojs3.unpatti.ac.id/index.php/barekeng/article/view/9570/7195</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2023 Aditya Ambarwati, Vira Hari Krisnawati</dc:rights>
	<dc:rights xml:lang="en-US">http://creativecommons.org/licenses/by-sa/4.0</dc:rights>
</oai_dc:dc>