TYPES OF SPECIAL GRAPHS AND THEIR COMPLEXITY TREES

Iqbal M. Batiha; Nidal Anakira; Hamzah O. Al-Khawaldeh; Mohammad Shehab; Tala Sasa; Basma Mohamed

doi:10.14317/jami.2025.1487

TYPES OF SPECIAL GRAPHS AND THEIR COMPLEXITY TREES

Iqbal M. Batiha
, Nidal Anakira
, Hamzah O. Al-Khawaldeh
, Mohammad Shehab
, Tala Sasa
, Basma Mohamed

Nonlinear Dynamic Research Centre (NDRC)

Al-Zaytoonah University of Jordan
Sohar University
Applied Science Private University
Al al-Bayt University
Amman Arab University
Giza Higher Institute for Managerial Sciences

Research output: Contribution to journal › Article › peer-review

Abstract

The enumeration of spanning trees in graphs is a fundamental topic with applications across various fields, including physics, mathematics, theoretical computer science, and chemistry. It is also integral to network routing protocols. Minimum spanning trees play a crucial role in optimizing infrastructure such as water networks, electrical grids, and computer systems. They are essential in solving network problems like the traveling salesman problem and are used in key algorithms such as the mincut max-flow method. In this paper, we compute the number of spanning trees in three classes of graphs: 4∆_k, 6∆_k, and the Dutch windmill graph.

Original language	English
Pages (from-to)	1487-1500
Number of pages	14
Journal	Journal of Applied Mathematics and Informatics
Volume	43
Issue number	5
DOIs	https://doi.org/10.14317/jami.2025.1487
State	Published - 2025

Keywords

Complexity of graphs
Dutch windmill graph
spanning trees

Access to Document

10.14317/jami.2025.1487

Cite this

@article{964aec3fb0ba4b0e903ffc9c74918ae1,

title = "TYPES OF SPECIAL GRAPHS AND THEIR COMPLEXITY TREES",

abstract = "The enumeration of spanning trees in graphs is a fundamental topic with applications across various fields, including physics, mathematics, theoretical computer science, and chemistry. It is also integral to network routing protocols. Minimum spanning trees play a crucial role in optimizing infrastructure such as water networks, electrical grids, and computer systems. They are essential in solving network problems like the traveling salesman problem and are used in key algorithms such as the mincut max-flow method. In this paper, we compute the number of spanning trees in three classes of graphs: 4∆k, 6∆k, and the Dutch windmill graph.",

keywords = "Complexity of graphs, Dutch windmill graph, spanning trees",

author = "Batiha, \{Iqbal M.\} and Nidal Anakira and Al-Khawaldeh, \{Hamzah O.\} and Mohammad Shehab and Tala Sasa and Basma Mohamed",

note = "Publisher Copyright: {\textcopyright} 2025 KSCAM.",

year = "2025",

doi = "10.14317/jami.2025.1487",

language = "English",

volume = "43",

pages = "1487--1500",

journal = "Journal of Applied Mathematics and Informatics",

issn = "2734-1194",

publisher = "Korean Society for Computational and Applied Mathematics",

number = "5",

}

TY - JOUR

T1 - TYPES OF SPECIAL GRAPHS AND THEIR COMPLEXITY TREES

AU - Batiha, Iqbal M.

AU - Anakira, Nidal

AU - Al-Khawaldeh, Hamzah O.

AU - Shehab, Mohammad

AU - Sasa, Tala

AU - Mohamed, Basma

PY - 2025

Y1 - 2025

N2 - The enumeration of spanning trees in graphs is a fundamental topic with applications across various fields, including physics, mathematics, theoretical computer science, and chemistry. It is also integral to network routing protocols. Minimum spanning trees play a crucial role in optimizing infrastructure such as water networks, electrical grids, and computer systems. They are essential in solving network problems like the traveling salesman problem and are used in key algorithms such as the mincut max-flow method. In this paper, we compute the number of spanning trees in three classes of graphs: 4∆k, 6∆k, and the Dutch windmill graph.

AB - The enumeration of spanning trees in graphs is a fundamental topic with applications across various fields, including physics, mathematics, theoretical computer science, and chemistry. It is also integral to network routing protocols. Minimum spanning trees play a crucial role in optimizing infrastructure such as water networks, electrical grids, and computer systems. They are essential in solving network problems like the traveling salesman problem and are used in key algorithms such as the mincut max-flow method. In this paper, we compute the number of spanning trees in three classes of graphs: 4∆k, 6∆k, and the Dutch windmill graph.

KW - Complexity of graphs

KW - Dutch windmill graph

KW - spanning trees

UR - https://www.scopus.com/pages/publications/105019690902

U2 - 10.14317/jami.2025.1487

DO - 10.14317/jami.2025.1487

M3 - Article

AN - SCOPUS:105019690902

SN - 2734-1194

VL - 43

SP - 1487

EP - 1500

JO - Journal of Applied Mathematics and Informatics

JF - Journal of Applied Mathematics and Informatics

IS - 5

ER -

TYPES OF SPECIAL GRAPHS AND THEIR COMPLEXITY TREES

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this