A Bipartite Graph Associated to Elements and Class Equivalences of A Finite Heap

In this study, we introduce a bipartite graph associated to elements and equivalence classes of a heap. We find some invariant numbers of the graph. Furthermore, we associate the graph properties of the graph of domain and codomain of surjective heap morphism. We also investigate the tensor product of the bipartite graph of heaps.

Authors

Institutions

Publication Details

Journal
Malaysian Journal of Mathematical Sciences
Published
2024-12-24
DOI
https://doi.org/10.47836/mjms.18.4.08
Citations
1
Primary Topic
Finite Group Theory Research
Type
article
Field-Weighted Citation Impact
1.32
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Bipartite Graph Associated to Elements and Class Equivalences of A Finite Heap

Dewi Ismiarti, Dwi Mifta Mahanani
1 citations
Malaysian Journal of Mathematical Sciences
Finite Group Theory Research
1.32
article

A Bipartite Graph Associated to Elements and Class Equivalences of A Finite Heap

Dewi Ismiarti, Dwi Mifta Mahanani
article en
1 citations

Abstract

In this study, we introduce a bipartite graph associated to elements and equivalence classes of a heap. We find some invariant numbers of the graph. Furthermore, we associate the graph properties of the graph of domain and codomain of surjective heap morphism. We also investigate the tensor product of the bipartite graph of heaps.

Malaysian Journal of Mathematical SciencesVol. 18(4)
University of Brawijaya (ID), Universitas Islam Negeri Maulana Malik Ibrahim (ID)
Openalex Percentile: Top 18%
Finite Group Theory Research
1.32
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.