Upper Bounds for Rainbow 2-Connectivity of the Cartesian Product of a Path and a Cycle | Zendy

Bety Hayat Susanti | Zendy; A.N.M. Salman | Zendy; Rinovia Simanjuntak | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Upper Bounds for Rainbow 2-Connectivity of the Cartesian Product of a Path and a Cycle

Author(s) -

Bety Hayat Susanti,

A.N.M. Salman,

Rinovia Simanjuntak

Publication year - 2015

Publication title -

procedia computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.334

H-Index - 76

ISSN - 1877-0509

DOI - 10.1016/j.procs.2015.12.091

Subject(s) - cartesian product , rainbow , combinatorics , graph , path (computing) , computer science , cartesian coordinate system , connectivity , upper and lower bounds , integer (computer science) , path graph , colored , mathematics , discrete mathematics , graph power , physics , geometry , line graph , computer network , materials science , quantum mechanics , composite material , programming language , mathematical analysis

A path P in an edge-colored graph G where adjacent edges may be colored the same is said to be a rainbow path, if its edges have distinct colors. For a κ-connected graph G and an integer k with 1 ≤ k ≤ κ, the rainbow k-connectivity, rck (G) of G is defined as the minimum integer j for which there exists a j-edge-coloring of G such that every two distinct vertices of G are connected by k internally disjoint rainbow paths. In this paper, we determine upper bounds for rainbow 2-connectivity of the Cartesian product of two paths and the Cartesian product of a cycle and a path

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research