Local coloring of self complementary graphs
Let be a graph. A local coloring of a graph of order at least 2 is a function having the property that for each set with , there exist vertices such that , where is the size of the induced subgraph . The maximum color assigned by a local coloring to a vertex of is called the value of and is denoted...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Taylor & Francis Group
2017-04-01
|
| Series: | AKCE International Journal of Graphs and Combinatorics |
| Subjects: | |
| Online Access: | http://dx.doi.org/10.1016/j.akcej.2016.11.005 |
| _version_ | 1818479451152842752 |
|---|---|
| author | P. Deepa P. Srinivasan M. Sundarakannan |
| author_facet | P. Deepa P. Srinivasan M. Sundarakannan |
| author_sort | P. Deepa |
| collection | DOAJ |
| description | Let be a graph. A local coloring of a graph of order at least 2 is a function having the property that for each set with , there exist vertices such that , where is the size of the induced subgraph . The maximum color assigned by a local coloring to a vertex of is called the value of and is denoted by . The local chromatic number of is , where the minimum is taken over all local colorings of . In this paper we study the local coloring for some self complementary graphs. Also we present a sc-graph with local chromatic number for any given integer . |
| first_indexed | 2024-12-10T11:10:45Z |
| format | Article |
| id | doaj.art-6e66fd6468fe4e619e16120df3812edf |
| institution | Directory Open Access Journal |
| issn | 0972-8600 |
| language | English |
| last_indexed | 2024-12-10T11:10:45Z |
| publishDate | 2017-04-01 |
| publisher | Taylor & Francis Group |
| record_format | Article |
| series | AKCE International Journal of Graphs and Combinatorics |
| spelling | doaj.art-6e66fd6468fe4e619e16120df3812edf2022-12-22T01:51:25ZengTaylor & Francis GroupAKCE International Journal of Graphs and Combinatorics0972-86002017-04-01141354110.1016/j.akcej.2016.11.00512092610Local coloring of self complementary graphsP. Deepa0P. Srinivasan1M. Sundarakannan2Department of Mathematics, Prathyusha Institute of Technology and Management, Aranvoyal kuppam, PonamaleeDepartment of Mathematics, The American CollegeDepartment of Mathematics, SSN College of EngineeringLet be a graph. A local coloring of a graph of order at least 2 is a function having the property that for each set with , there exist vertices such that , where is the size of the induced subgraph . The maximum color assigned by a local coloring to a vertex of is called the value of and is denoted by . The local chromatic number of is , where the minimum is taken over all local colorings of . In this paper we study the local coloring for some self complementary graphs. Also we present a sc-graph with local chromatic number for any given integer .http://dx.doi.org/10.1016/j.akcej.2016.11.005coloringlocal coloringlocal chromatic numberself complementary graph |
| spellingShingle | P. Deepa P. Srinivasan M. Sundarakannan Local coloring of self complementary graphs AKCE International Journal of Graphs and Combinatorics coloring local coloring local chromatic number self complementary graph |
| title | Local coloring of self complementary graphs |
| title_full | Local coloring of self complementary graphs |
| title_fullStr | Local coloring of self complementary graphs |
| title_full_unstemmed | Local coloring of self complementary graphs |
| title_short | Local coloring of self complementary graphs |
| title_sort | local coloring of self complementary graphs |
| topic | coloring local coloring local chromatic number self complementary graph |
| url | http://dx.doi.org/10.1016/j.akcej.2016.11.005 |
| work_keys_str_mv | AT pdeepa localcoloringofselfcomplementarygraphs AT psrinivasan localcoloringofselfcomplementarygraphs AT msundarakannan localcoloringofselfcomplementarygraphs |