Notions of domination for some classses of graphs

If G = (V E) is a nite simple connected graph, a subset S of V is said to be a dominating set of the graph G if every vertex of G is either in S or is adjacent to at least one element of S. The minimum cardinality of a dominating set of G is called the domination number of G. In the present study, w...

Full description

Saved in:
Bibliographic Details
Main Authors: Castaneda, Adrian Timothy S., Medina, Matthew Ayemart S.
Format: text
Language:English
Published: Animo Repository 2015
Subjects:
Online Access:https://animorepository.dlsu.edu.ph/etd_bachelors/18387
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: De La Salle University
Language: English
id oai:animorepository.dlsu.edu.ph:etd_bachelors-18900
record_format eprints
spelling oai:animorepository.dlsu.edu.ph:etd_bachelors-189002022-02-03T23:57:56Z Notions of domination for some classses of graphs Castaneda, Adrian Timothy S. Medina, Matthew Ayemart S. If G = (V E) is a nite simple connected graph, a subset S of V is said to be a dominating set of the graph G if every vertex of G is either in S or is adjacent to at least one element of S. The minimum cardinality of a dominating set of G is called the domination number of G. In the present study, we considered variations of the concept of domination in a graph. Specifically, we looked into triple connected dominating sets and triple connected complementary tree dominating sets of a connected nite simple undirected graph, and the domination parameters of the triple connected domination number and triple connected complementary tree domination number. Conditions for the existence of such dominating sets, and bounds for the corresponding domination parameters, were identified. We also determined the exact values of these parameters for certain classes of graphs, and the relationship of these domination parameters with other graph parameters such as the chromatic number, connectivity, and maximum vertex degree. 2015-01-01T08:00:00Z text https://animorepository.dlsu.edu.ph/etd_bachelors/18387 Bachelor's Theses English Animo Repository Graph theory Domination (Graph theory) Mathematics
institution De La Salle University
building De La Salle University Library
continent Asia
country Philippines
Philippines
content_provider De La Salle University Library
collection DLSU Institutional Repository
language English
topic Graph theory
Domination (Graph theory)
Mathematics
spellingShingle Graph theory
Domination (Graph theory)
Mathematics
Castaneda, Adrian Timothy S.
Medina, Matthew Ayemart S.
Notions of domination for some classses of graphs
description If G = (V E) is a nite simple connected graph, a subset S of V is said to be a dominating set of the graph G if every vertex of G is either in S or is adjacent to at least one element of S. The minimum cardinality of a dominating set of G is called the domination number of G. In the present study, we considered variations of the concept of domination in a graph. Specifically, we looked into triple connected dominating sets and triple connected complementary tree dominating sets of a connected nite simple undirected graph, and the domination parameters of the triple connected domination number and triple connected complementary tree domination number. Conditions for the existence of such dominating sets, and bounds for the corresponding domination parameters, were identified. We also determined the exact values of these parameters for certain classes of graphs, and the relationship of these domination parameters with other graph parameters such as the chromatic number, connectivity, and maximum vertex degree.
format text
author Castaneda, Adrian Timothy S.
Medina, Matthew Ayemart S.
author_facet Castaneda, Adrian Timothy S.
Medina, Matthew Ayemart S.
author_sort Castaneda, Adrian Timothy S.
title Notions of domination for some classses of graphs
title_short Notions of domination for some classses of graphs
title_full Notions of domination for some classses of graphs
title_fullStr Notions of domination for some classses of graphs
title_full_unstemmed Notions of domination for some classses of graphs
title_sort notions of domination for some classses of graphs
publisher Animo Repository
publishDate 2015
url https://animorepository.dlsu.edu.ph/etd_bachelors/18387
_version_ 1772835115100012544