The Set Chromatic Numbers of the Middle Graph of Graphs
For a simple connected graph G; let c : V (G) → N be a vertex coloring of G; where adjacent vertices may be colored the same. The neighborhood color set of a vertex v; denoted by NC(v); is the set of colors of the neighbors of v. The coloring c is called a set coloring provided that NC(u) neq NC(v)...
Saved in:
Main Authors: | , , |
---|---|
Format: | text |
Published: |
Archīum Ateneo
2021
|
Subjects: | |
Online Access: | https://archium.ateneo.edu/mathematics-faculty-pubs/160 https://archium.ateneo.edu/cgi/viewcontent.cgi?article=1165&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-1165 |
---|---|
record_format |
eprints |
spelling |
ph-ateneo-arc.mathematics-faculty-pubs-11652022-02-04T02:09:26Z The Set Chromatic Numbers of the Middle Graph of Graphs Eugenio, Gerone Russel J Ruiz, Mari-Jo P Tolentino, Mark Anthony C For a simple connected graph G; let c : V (G) → N be a vertex coloring of G; where adjacent vertices may be colored the same. The neighborhood color set of a vertex v; denoted by NC(v); is the set of colors of the neighbors of v. The coloring c is called a set coloring provided that NC(u) neq NC(v) for every pair of adjacent vertices u and v of G. The minimum number of colors needed for a set coloring of G is referred to as the set chromatic number of G and is denoted by χ_s(G). In this work; the set chromatic number of graphs is studied inrelation to the graph operation called middle graph. Our results include the exact set chromatic numbers of the middle graph of cycles; paths; star graphs; double-star graphs; and some trees of height 2. Moreover; we establish the sharpness of some bounds on the set chromatic number of general graphs obtained using this operation. Finally; we develop an algorithm for constructingan optimal set coloring of the middle graph of trees of height 2 under some assumptions. 2021-03-23T07:00:00Z text application/pdf https://archium.ateneo.edu/mathematics-faculty-pubs/160 https://archium.ateneo.edu/cgi/viewcontent.cgi?article=1165&context=mathematics-faculty-pubs Mathematics Faculty Publications Archīum Ateneo set coloring middle graph 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 middle graph Mathematics |
spellingShingle |
set coloring middle graph Mathematics Eugenio, Gerone Russel J Ruiz, Mari-Jo P Tolentino, Mark Anthony C The Set Chromatic Numbers of the Middle Graph of Graphs |
description |
For a simple connected graph G; let c : V (G) → N be a vertex coloring of G; where adjacent vertices may be colored the same. The neighborhood color set of a vertex v; denoted by NC(v); is the set of colors of the neighbors of v. The coloring c is called a set coloring provided that NC(u) neq NC(v) for every pair of adjacent vertices u and v of G. The minimum number of colors needed for a set coloring of G is referred to as the set chromatic number of G and is denoted by χ_s(G). In this work; the set chromatic number of graphs is studied inrelation to the graph operation called middle graph. Our results include the exact set chromatic numbers of the middle graph of cycles; paths; star graphs; double-star graphs; and some trees of height 2. Moreover; we establish the sharpness of some bounds on the set chromatic number of general graphs obtained using this operation. Finally; we develop an algorithm for constructingan optimal set coloring of the middle graph of trees of height 2 under some assumptions. |
format |
text |
author |
Eugenio, Gerone Russel J Ruiz, Mari-Jo P Tolentino, Mark Anthony C |
author_facet |
Eugenio, Gerone Russel J Ruiz, Mari-Jo P Tolentino, Mark Anthony C |
author_sort |
Eugenio, Gerone Russel J |
title |
The Set Chromatic Numbers of the Middle Graph of Graphs |
title_short |
The Set Chromatic Numbers of the Middle Graph of Graphs |
title_full |
The Set Chromatic Numbers of the Middle Graph of Graphs |
title_fullStr |
The Set Chromatic Numbers of the Middle Graph of Graphs |
title_full_unstemmed |
The Set Chromatic Numbers of the Middle Graph of Graphs |
title_sort |
set chromatic numbers of the middle graph of graphs |
publisher |
Archīum Ateneo |
publishDate |
2021 |
url |
https://archium.ateneo.edu/mathematics-faculty-pubs/160 https://archium.ateneo.edu/cgi/viewcontent.cgi?article=1165&context=mathematics-faculty-pubs |
_version_ |
1724079166993727488 |