Proves χ_i(S_{C_k}^n)=3 for n≥2 and χ_i(S_G^n) ∈ {χ_i(G), χ_i(G)+1}, plus χ_i'(S_{K_3}^n)=5 for n≥3 with similar bounds for triangle-free G.
Panda and Priyamvada, Injective coloring of some subclasses of bipartite graphs and chordal graphs, Discrete Appl
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Injective (edge) colorings of generalized Sierpi\'{n}ski graphs
Proves χ_i(S_{C_k}^n)=3 for n≥2 and χ_i(S_G^n) ∈ {χ_i(G), χ_i(G)+1}, plus χ_i'(S_{K_3}^n)=5 for n≥3 with similar bounds for triangle-free G.