The Strong 3-rainbow Index of Comb Product of a Tree and a Connected Graph-Reference-Cited by-同舟云学术

The Strong 3-rainbow Index of Comb Product of a Tree and a Connected Graph

Published:2020 Issue:0 Volume:28 Page:865-875
ISSN:1882-6652
Container-title:Journal of Information Processing
language:en
Short-container-title:Journal of Information Processing

Author:

Awanis Zata Yumni¹,Salman A.N.M.¹,Saputro Suhadi Wido¹

Affiliation:

1. Combinatorial Mathematics Research Group, Faculty of Mathematics and Natural Sciences, Institut Teknologi Bandung

Publisher

Information Processing Society of Japan

Subject

General Computer Science

Link

https://www.jstage.jst.go.jp/article/ipsjjip/28/0/28_865/_pdf

Reference30 articles.

1. [1] Awanis, Z.Y., Salman, A., Saputro, S.W., Bača, M. and Semaničová-Feňovčíková, A.: The strong 3-rainbow index of edge-amalgamation of some graphs, Turkish Journal of Mathematics, Vol.44, pp.446-462 (2020).

2. [2] Awanis, Z.Y. and Salman, A.N.M.: The strong 3-rainbow index of some graphs and its amalgamation, submitted.

3. [3] Awanis, Z.Y. and Salman, A.N.M.: The 3-rainbow index of amalgamation of some graphs with diameter 2, IOP Conference Series: Journal of Physics, Vol.1127, 012058 (2019).

4. [4] Bača, M., Salman, A.N.M., Simanjuntak, R. and Susanti, B.H.: Rainbow 2-connectivity of edge-comb product of a cycle and a Hamiltonian graph, Proc. Mathematical Sciences, Vol.130, No.9 (2020).

5. [5] Cai, Q., Li, X. and Zhao, Y.: Note on the upper bound of the rainbow index of a graph, Discrete Applied Mathematics, Vol.209, pp.68-74 (2016).

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Graphs with strong 3-rainbow index equals 2;Journal of Physics: Conference Series;2022-01-01