Scholarlink

<p>Two relationships between the injective chromatic number and, respectively, chromatic number and chromatic index, are proved. They are applied to determine the injective chromatic number of Sierpiński graphs and to give a short proof that Sierpiński graphs are Class 1. Sierpiński-like graphs are also considered, including generalized Sierpiński graphs over cycles and rooted products. It is proved that the injective chromatic number of a rooted product of two graphs lies in a set of six possible values. Sierpiński graphs and Kneser graphs <i>K</i>(<i>n</i>,&#xa0;<i>r</i>) are considered with respect of being perfect injectively colorable, where a graph is perfect injectively colorable if it has an injective coloring in which every color class forms an open packing of largest cardinality. In particular, all Sierpiński graphs and Kneser graphs <i>K</i>(<i>n</i>,&#xa0;<i>r</i>) with <InlineEquation ID="IEq1"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="373_2025_2952_Article_IEq1.gif" Format="GIF" Height="15" Rendition="HTML" Resolution="72" Type="Linedraw" Width="80" /> </InlineMediaObject> <EquationSource Format="TEX">\(n \ge 3r-1\)</EquationSource> </InlineEquation> are perfect injectively colorable, while <i>K</i>(7,&#xa0;3) is not.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Injective Colorings of Sierpiński-like Graphs and Kneser Graphs

  • 期刊论文

  • 出版模式：

    开放获取

  • 发表日期：

    2025年7月24日

查看全文
  • Boštjan Brešar,
  • Sandi Klavžar,
  • Babak Samadi,
  • Ismael G. Yero

摘要

Two relationships between the injective chromatic number and, respectively, chromatic number and chromatic index, are proved. They are applied to determine the injective chromatic number of Sierpiński graphs and to give a short proof that Sierpiński graphs are Class 1. Sierpiński-like graphs are also considered, including generalized Sierpiński graphs over cycles and rooted products. It is proved that the injective chromatic number of a rooted product of two graphs lies in a set of six possible values. Sierpiński graphs and Kneser graphs K(n, r) are considered with respect of being perfect injectively colorable, where a graph is perfect injectively colorable if it has an injective coloring in which every color class forms an open packing of largest cardinality. In particular, all Sierpiński graphs and Kneser graphs K(n, r) with \(n \ge 3r-1\) are perfect injectively colorable, while K(7, 3) is not.