Article Per Year (5 Year)
p-Index From 2020 - 2025
0.23
P-Index
This Author published in this journals
All Journal Pythagoras: Jurnal Matematika dan Pendidikan Matematika
Hanssen, Calvin
Unknown Affiliation
Education Mathematics

Published : 1 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search

 1 
The Complexity of Pencil Graph and Line Pencil Graph Hanssen, Calvin; Fran, Fransiskus; Yundari, Yundari
PYTHAGORAS Jurnal Matematika dan Pendidikan Matematika Vol. 19 No. 2: December 2024
Publisher : Department of Mathematics Education, Faculty of Mathematics and Natural Sciences, UNY

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.21831/pythagoras.v19i2.77747

Abstract

Let ð’¢ be a linked and undirected graph. Every linked graph ð’¢ must contain a spanning tree ð’¯, which is a subgraph of ð’¢that is a tree and contain all the nodes of ð’¢. The number of spanning trees in graph ð’¢, also called the complexity of the graph ð’¢, represented by Ï„(𝒢), is the total number of distinct spanning trees of graph ð’¢. This research aims to formulate the complexity of pencil graph and line pencil graph. In this research, the complexity of pencil graph and line pencil graph are determined using graph complement approach. The result of the research are the complexity of pencil graph and line pencil graph.
Co-Authors Fran, Fransiskus Yundari, Yundari