Jurnal
SINTA 3
TRACE OF THE ADJACENCY MATRIX n×n OF THE CYCLE GRAPH TO THE POWER OF TWO TO FIVE
BAREKENG: Jurnal Ilmu Matematika dan Terapan · Vol. 16 No. 2 (2022) · pp. 393–408
ISSN 2615-3017, 1978-7227
Published 2022-06-01
Publisher PATTIMURA UNIVERSITY
Language eng
Abstract
The main aim of this research is to find the formula of the trace of adjacency matrix from a cycle graph to the power of two to five. To obtain the general form, the first step is finding the general formula of the adjacency matrix from a cycle graph to the power of two to five. Furthermore, the formula of the trace of adjacency matrix which is mentioned above obtained and proven by direct proof. We also present an implementation of the formula which is given by an example.
Collaboration network of the authors
10 authors ·
19 co-authorship links
Hover or tap a name to highlight its co-authors. Double-click to open the author's page.
State University of Malang Affiliation unknown
Different organisations
Same organisation
Affiliation unknown
Thicker line = more joint articles · bigger circle = more articles
Show as table
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">TRACE OF THE ADJACENCY MATRIX n×n OF THE CYCLE GRAPH TO THE POWER OF TWO TO FIVE</dc:title>
<dc:creator>Aryani, Fitri</dc:creator>
<dc:creator>Puspita, Dian Ayu</dc:creator>
<dc:creator>Marzuki, Corry Corazon</dc:creator>
<dc:creator>Muda, Yuslenita</dc:creator>
<dc:description xml:lang="en-US">The main aim of this research is to find the formula of the trace of adjacency matrix &nbsp;from a cycle graph to the power of two to five. To obtain the general form, the first step is finding the general formula of the adjacency matrix from a cycle graph to the power of two to five. Furthermore, the formula of the trace of adjacency matrix which is mentioned above obtained and proven by direct proof. We also present an implementation of the formula which is given by an example. </dc:description>
<dc:publisher xml:lang="en-US">PATTIMURA UNIVERSITY</dc:publisher>
<dc:date>2022-06-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/4508</dc:identifier>
<dc:identifier>10.30598/barekengvol16iss2pp393-408</dc:identifier>
<dc:source xml:lang="en-US">BAREKENG: Jurnal Ilmu Matematika dan Terapan; Vol 16 No 2 (2022): BAREKENG: Jurnal Ilmu Matematika dan Terapan; 393-408</dc:source>
<dc:source>2615-3017</dc:source>
<dc:source>1978-7227</dc:source>
<dc:source>10.30598/barekengvol16iss2year2022</dc:source>
<dc:language>eng</dc:language>
<dc:relation>https://ojs3.unpatti.ac.id/index.php/barekeng/article/view/4508/4466</dc:relation>
</oai_dc:dc>
Citations and indexing
OpenAlex
Not checked
Crossref
Not checked
Cite this article
APA 7
Aryani, F., Puspita, D. A., Marzuki, C. C., & Muda, Y. (2022). TRACE OF THE ADJACENCY MATRIX n×n OF THE CYCLE GRAPH TO THE POWER OF TWO TO FIVE. BAREKENG: Jurnal Ilmu Matematika dan Terapan, 16(2), 393–408. https://doi.org/10.30598/barekengvol16iss2pp393-408
Copy
IEEE
F. Aryani, D. A. Puspita, C. C. Marzuki, and Y. Muda, “TRACE OF THE ADJACENCY MATRIX n×n OF THE CYCLE GRAPH TO THE POWER OF TWO TO FIVE,” BAREKENG: Jurnal Ilmu Matematika dan Terapan, vol. 16, no. 2, pp. 393–408, 2022, doi: 10.30598/barekengvol16iss2pp393-408.
Copy
Generated from the journal's metadata; check author names before use.