On injective chromatic polynomials of graphs
2015 ◽
Vol 07
(03)
◽
pp. 1550035
Keyword(s):
The injective chromatic number χi(G) [G. Hahn, J. Kratochvil, J. Siran and D. Sotteau, On the injective chromatic number of graphs, Discrete Math. 256(1–2) (2002) 179–192] of a graph G is the minimum number of colors needed to color the vertices of G such that two vertices with a common neighbor are assigned distinct colors. The nature of the coefficients of injective chromatic polynomials of complete graphs, wheel graphs and cycles is studied. Injective chromatic polynomial on operations like union, join, product and corona of graphs is obtained.
2020 ◽
Vol 16
(3)
◽
pp. 297-299
Keyword(s):
1967 ◽
Vol 2
(4)
◽
pp. 571-584
◽
2014 ◽
Vol 24
(4)
◽
pp. 658-679
◽
Keyword(s):
1969 ◽
Vol 21
◽
pp. 992-1000
◽
Keyword(s):
2007 ◽
Vol Vol. 9 no. 1
(Graph and Algorithms)
◽
2013 ◽
2020 ◽
Vol 12
(04)
◽
pp. 2050035
Keyword(s):
Keyword(s):