On the zero ring index of some classes of graphs

Date of Publication

2018

Document Type

Bachelor's Thesis

Degree Name

Bachelor of Science in Mathematics with specialization in Business Applications

Subject Categories

Mathematics

College

College of Science

Department/Unit

Mathematics and Statistics

Abstract/Summary

This study focuses on a labeling of the vertices of a graph G. A zero ring is a ring denoted by R0 where the product of any two distinct elements is equal to 0, the additive identity of the ring. A zero ring labeling of G is an assignment f of elements of R0 to the vertices of G such that f(x) + f(y) 6= 0 whenever x y are adjacent in G. It is known that every graph has a zero ring labeling, so an interesting problem to consider is to determine the smallest positive integer (G) such that there exists a zero ring R0 of order (G) for which G admits a zero ring labeling. This graph parameter is called the zero ring index of the graph G. In this paper, we aim to discuss the zero ring indices of some common classes of graphs, such as paths, fans, wheels, helms, complete bipartite graphs, complete tripartite graphs, and complete four-partite graphs. Furthermore, we aim to determine the zero ring index of a general multi-partite graph, and to discuss characterizations for graphs whose zero ring indices are equal to their order.

Abstract Format

html

Language

English

Format

Electronic

Accession Number

CDTU017655

Shelf Location

Archives, The Learning Commons, 12F, Henry Sy Sr. Hall

This document is currently not available here.

Share

COinS