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...
Huvudupphovsmän: | P. Deepa, P. Srinivasan, M. Sundarakannan |
---|---|
Materialtyp: | Artikel |
Språk: | English |
Publicerad: |
Taylor & Francis Group
2017-04-01
|
Serie: | AKCE International Journal of Graphs and Combinatorics |
Ämnen: | |
Länkar: | http://dx.doi.org/10.1016/j.akcej.2016.11.005 |
Liknande verk
-
Local edge coloring of graphs
av: P. Deepa, et al.
Publicerad: (2021-01-01) -
Contemporary Methods for Graph Coloring as an Example of Discrete Optimization
av: Adrian Bilski
Publicerad: (2019-06-01) -
On local antimagic vertex coloring of corona products related to friendship and fan graph
av: Zein Rasyid Himami, et al.
Publicerad: (2021-12-01) -
Solving Graph Coloring Problem Using Graph Adjacency Matrix Algorithm
av: Hanife Mousavi, et al.
Publicerad: (2024-06-01) -
Note on robust coloring of planar graphs
av: František Kardoš, et al.
Publicerad: (2024-12-01)