The corona between cycles and paths | Zendy

S.I. Nada | Zendy; Ashraf ELrokh | Zendy; E. A. Elsakhawi | Zendy; D. E. Sabra | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

The corona between cycles and paths

Author(s) -

S.I. Nada,

Ashraf ELrokh,

E. A. Elsakhawi,

D. E. Sabra

Publication year - 2017

Publication title -

journal of the egyptian mathematical society

Language(s) - English

Resource type - Journals

eISSN - 2090-9128

pISSN - 1110-256X

DOI - 10.1016/j.joems.2016.08.004

Subject(s) - combinatorics , vertex (graph theory) , mathematics , graph , corona (planetary geology) , wheel graph , enhanced data rates for gsm evolution , discrete mathematics , physics , graph power , computer science , line graph , telecommunications , astrobiology , venus

A graph is said to be cordial if it has a 0–1 labeling that satisfies certain properties. The corona G1⨀G2 of two graphs G1(with n1 vertices and m1 edges) and G2 (with n2 vertices and m2 edges) is defined as the graph obtained by taking one copy of G1 and n1 copies of G2, and then joining the ith vertex of G1 with an edge to every vertex in the ith copy of G2. In this paper we investigate the cordiality of the corona between cycles Cn and paths Pn, namely Cn⨀Pm

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