Committee Chair

Walters, Terry

Committee Member

Cetinkaya, Fatma Ayça; Nichols, Roger

Department

Dept. of Mathematics

College

College of Arts and Sciences

Publisher

University of Tennessee at Chattanooga

Place of Publication

Chattanooga (Tenn.)

Abstract

The complementary prism GG of a graph G is formed from the disjoint union of G and its complement G by adding the edges of a perfect matching between the corresponding vertices of G and G. The induced path number, denoted ρ(G), of a graph G is defined as the minimum number of subsets that the vertex set of G can be partitioned into such that each subset induces a path. In this paper, we study the induced path number of complementary prisms of complete graphs, stars, paths, and cycles.

Acknowledgments

I want to thank Dr. Walters for his guidance throughout my Thesis work. I am endlessly grateful to my wife, Juli, for her constant support.

Degree

M. S.; A thesis submitted to the faculty of the University of Tennessee at Chattanooga in partial fulfillment of the requirements of the degree of Master of Science.

Date

5-2025

Subject

Combinatorial analysis; Graph theory; Mathematical optimization

Keyword

Graph, Induced Path Number, Complementary Prism, Induced Path

Document Type

Masters theses

DCMI Type

Text

Extent

ix, 34 leaves

Language

English

Rights

http://rightsstatements.org/vocab/InC/1.0/

License

http://creativecommons.org/licenses/by/4.0/

Date Available

5-31-2026

Download

Available for download on Sunday, May 31, 2026

Share

COinS