Strong 3-Rainbow Indexes of Closed Helm Graphs

Let <em>G</em> be a nontrivial, edge-colored, and connected graph of order <em>m</em>≥3 where adjacent edges may have the same color. A tree <em>T</em> in graph <em>G</em> is called a rainbow tree if all the edges in <em>T</em> have different colors. For <em>S</em>⊆<em>V</em>(<em>G</em>), the Steine...

全面介紹

書目詳細資料

Principais autores:	Calista Suci Nugrahani, Christian Constantine, A. N. M. Salman
格式:	Artigo
語言:	Inglês
出版:	InaCombS; Universitas Jember; dan Universitas Indonesia 2024-12-01
叢編:	Indonesian Journal of Combinatorics
主題:	closed helm graph rainbow coloring rainbow tree strong k-rainbow index
在線閱讀:	http://www.ijc.or.id/index.php/ijc/article/view/225
標簽:	添加標簽 沒有標簽, 成為第一個標記此記錄!