Discussion on Maximal Edge-ideal in Graph Theory
The exploration of width parameters within the fields of graph theory and algebra has garnered significant interest. Among these parameters, tree-cut decomposition stands out as a vital metric. The "Edge-Tangle" concept is intrinsically linked to the width parameter known as "tree-cut width" in graph theory. In this paper, we introduce a new definition termed Maximal Edge-Ideal for graphs and demonstrate their equivalence to Edge-Tangles.
Authors
- Takao Fujita (ORCID: https://orcid.org/0009-0007-1509-2728)
Institutions
- Shinjuku College of Information Technology (JP)
Publication Details
- Journal
- Asian Research Journal of Mathematics
- Published
- 2025-03-19
- DOI
- https://doi.org/10.9734/arjom/2025/v21i3904
- Citations
- 1
- Primary Topic
- Commutative Algebra and Its Applications
- Type
- article
- Field-Weighted Citation Impact
- 5.38