On the Total Set Chromatic Number of Graphs

Given a vertex coloring c of a graph, the neighborhood color set of a vertex is defined to be the set of all of its neighbors’ colors. The coloring c is called a set coloring if any two adjacent vertices have different neighborhood color sets. The set chromatic number χs(G) of a graph G is the minim...

Full description

Saved in:
Bibliographic Details
Main Authors: Tolentino, Mark Anthony C, Eugenio, Gerone Russel J, Ruiz, Mari-Jo P
Format: text
Published: Archīum Ateneo 2022
Subjects:
Online Access:https://archium.ateneo.edu/mathematics-faculty-pubs/216
https://archium.ateneo.edu/cgi/viewcontent.cgi?article=1217&context=mathematics-faculty-pubs
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Ateneo De Manila University
id ph-ateneo-arc.mathematics-faculty-pubs-1217
record_format eprints
spelling ph-ateneo-arc.mathematics-faculty-pubs-12172022-11-23T01:32:36Z On the Total Set Chromatic Number of Graphs Tolentino, Mark Anthony C Eugenio, Gerone Russel J Ruiz, Mari-Jo P Given a vertex coloring c of a graph, the neighborhood color set of a vertex is defined to be the set of all of its neighbors’ colors. The coloring c is called a set coloring if any two adjacent vertices have different neighborhood color sets. The set chromatic number χs(G) of a graph G is the minimum number of colors required in a set coloring of G. In this work, we investigate a total analog of set colorings, that is, we study set colorings of the total graph of graphs. Given a graph G = (V; E); its total graph T (G) is the graph whose vertex set is V ∪ E and in which two vertices are adjacent if and only if their corresponding elements in G are adjacent or incident. First; we establish sharp bounds for the set chromatic number of the total graph of a graph. Furthermore, we study the set colorings of the total graph of different families of graphs. 2022-01-01T08:00:00Z text application/pdf https://archium.ateneo.edu/mathematics-faculty-pubs/216 https://archium.ateneo.edu/cgi/viewcontent.cgi?article=1217&context=mathematics-faculty-pubs Mathematics Faculty Publications Archīum Ateneo set coloring total graph Mathematics Physical Sciences and Mathematics
institution Ateneo De Manila University
building Ateneo De Manila University Library
continent Asia
country Philippines
Philippines
content_provider Ateneo De Manila University Library
collection archium.Ateneo Institutional Repository
topic set coloring
total graph
Mathematics
Physical Sciences and Mathematics
spellingShingle set coloring
total graph
Mathematics
Physical Sciences and Mathematics
Tolentino, Mark Anthony C
Eugenio, Gerone Russel J
Ruiz, Mari-Jo P
On the Total Set Chromatic Number of Graphs
description Given a vertex coloring c of a graph, the neighborhood color set of a vertex is defined to be the set of all of its neighbors’ colors. The coloring c is called a set coloring if any two adjacent vertices have different neighborhood color sets. The set chromatic number χs(G) of a graph G is the minimum number of colors required in a set coloring of G. In this work, we investigate a total analog of set colorings, that is, we study set colorings of the total graph of graphs. Given a graph G = (V; E); its total graph T (G) is the graph whose vertex set is V ∪ E and in which two vertices are adjacent if and only if their corresponding elements in G are adjacent or incident. First; we establish sharp bounds for the set chromatic number of the total graph of a graph. Furthermore, we study the set colorings of the total graph of different families of graphs.
format text
author Tolentino, Mark Anthony C
Eugenio, Gerone Russel J
Ruiz, Mari-Jo P
author_facet Tolentino, Mark Anthony C
Eugenio, Gerone Russel J
Ruiz, Mari-Jo P
author_sort Tolentino, Mark Anthony C
title On the Total Set Chromatic Number of Graphs
title_short On the Total Set Chromatic Number of Graphs
title_full On the Total Set Chromatic Number of Graphs
title_fullStr On the Total Set Chromatic Number of Graphs
title_full_unstemmed On the Total Set Chromatic Number of Graphs
title_sort on the total set chromatic number of graphs
publisher Archīum Ateneo
publishDate 2022
url https://archium.ateneo.edu/mathematics-faculty-pubs/216
https://archium.ateneo.edu/cgi/viewcontent.cgi?article=1217&context=mathematics-faculty-pubs
_version_ 1751550483710869504