Normal view MARC view ISBD view

Some parameters of middle graph of antiprism graph / Kurt Jophet M. Igana, Catherine B. Iraula, and Jenny R. Rombano.

By:

Igana, Kurt Jophet M [author.]

Contributor(s):

Material type: Text

TextDescription: 67 leavesContent type:

text

Media type:

unmediated

Carrier type:

volume

Dissertation note: Undergraduate Theses (BSMATH) - Mathematics. Camarines Sur Polytechnic Colleges, 2026. Abstract: The graphs studied in this paper are finite, simple, and undirected graphs. This paper is a continuation of the previous work of Cernal, Hallare, and Suela on the middle graph of the antiprism graph, which established results on parameters such as connectivity, chromatic number, clique number, and vertex cover. This paper investigates additional parameters of the middle graph of the antiprism graph, denoted by M(APn). In particular, it examines the structural properties of M(APn) that remain unexplored and determines graph parameters such as the matching number, the existence of perfect matchings, edge cover, and domination. By analyzing these parameters, the study explains how the symmetry and regular structure of the antiprism graph influence its middle graph. The results contribute to existing studies in graph theory and provide a basis for future research on antiprism graphs and related graph transformations.

Tags from this library: No tags from this library for this title. Log in to add tags.

Holdings
Item type	Current library	Shelving location	Call number	Copy number	Status	Date due	Barcode
Unpublished Materials	Main Library	Undergraduate Thesis Section	UTH BSMATH I241s 2026 (Browse shelf(Opens below))	1-1	Not for loan		007454UM

Browsing Main Library shelves, Shelving location: Undergraduate Thesis Section Close shelf browser (Hides shelf browser)

Previous	No cover image available	No cover image available	No cover image available	No cover image available	No cover image available	No cover image available	No cover image available	Next
Previous	UTH BSMATH G112m 2026 Middle graph of fidget graph /	UTH BSMATH G1839a 2023 Average of the fibonacci numbers /	UTH BSMATH H113m 2026 Middle graph of cocktail party graph /	UTH BSMATH I241s 2026 Some parameters of middle graph of antiprism graph /	UTH BSMATH Ib6o 2022 On jesmanowicz' conjecture concerning primitive pytthagorean triples	UTH BSMATH In31c 2023 Coloring for the identity graphs of groups /	UTH BSMATH M6111t 2023 Tadpole domination in graphs /	Next

Undergraduate Theses (BSMATH) - Mathematics. Camarines Sur Polytechnic Colleges, 2026.

Includes bibliographical references.

The graphs studied in this paper are finite, simple, and undirected graphs. This paper is a continuation of the previous work of Cernal, Hallare, and Suela on the middle graph of the antiprism graph, which established results on parameters such as connectivity, chromatic number, clique number, and vertex cover. This paper investigates additional parameters of the middle graph of the antiprism graph, denoted by M(APn). In particular, it examines the structural properties of M(APn) that remain unexplored and determines graph parameters such as the matching number, the existence of perfect matchings, edge cover, and domination. By analyzing these parameters, the study explains how the symmetry and regular structure of the antiprism graph influence its middle graph. The results contribute to existing studies in graph theory and provide a basis for future research on antiprism graphs and related graph transformations.

There are no comments on this title.

to post a comment.