Rainbow Connection Number in Pyramid Networks
Abstract
References
Index Terms
- Rainbow Connection Number in Pyramid Networks
Recommendations
Rainbow Colorings on WK-recursive Pyramids
ICICM '19: Proceedings of the 9th International Conference on Information Communication and ManagementA path P is a rainbow path if P with all edges of different colors. An edge coloring graph G is rainbow connected if every two vertices are connected by a rainbow path. An edge coloring under which G is rainbow connected is a rainbow coloring. Rainbow ...
Rainbow Connection Number and Independence Number of a Graph
A path in an edge-colored graph is called rainbow if any two edges of the path have distinct colors. An edge-colored graph is called rainbow connected if there exists a rainbow path between every two vertices of the graph. For a connected graph G, the ...
Rainbow connection of graphs with diameter 2
A path in an edge-colored graph G, where adjacent edges may have the same color, is a rainbow path if no two edges of the path are colored the same. The rainbow connection numberrc(G) of G is the minimum integer k for which there exists a k-edge-...
Comments
Information & Contributors
Information
Published In
In-Cooperation
- University of Wollongong, Australia
- College of Technology Management, National Tsing Hua University, Taiwan
- Swinburne University of Technology
- University of Technology Sydney
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Author Tags
Qualifiers
- Research-article
- Research
- Refereed limited
Conference
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 40Total Downloads
- Downloads (Last 12 months)2
- Downloads (Last 6 weeks)1
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in