Graceful Labels Of Some Graphs Joined By An Arbitrary Path

Main Article Content

J.C. Kanani
P.Z. Akbari
V. J. Kaneria

Abstract

We proved the gracefulness of graphs formed by connecting different graphs. And found the result (1) The graph G is obtained by connecting a quadrilateral and a quadrilateral with one chord through a path of arbitrary length is graceful. (2) The graph G obtained through joined a quadrilateral with one chord and a barycentric subdivision of Cn (n ≡ 0,2 (mod 4)) by a path of arbitrary length is graceful. (3)The graph G obtained through joined a quadrilateral with one chord G1and a quadrilateral snake G2 by a path of arbitrary length is graceful.

Downloads

Download data is not yet available.

Article Details

How to Cite
J.C. Kanani, P.Z. Akbari, & V. J. Kaneria. (2023). Graceful Labels Of Some Graphs Joined By An Arbitrary Path. Educational Administration: Theory and Practice, 29(4), 3103–3112. https://doi.org/10.53555/kuey.v29i4.7797
Section
Articles
Author Biographies

J.C. Kanani

Government Polytechnic Rajkot−360003

P.Z. Akbari

Department of Mathematics, Saurashtra University, Rajkot−360005,

V. J. Kaneria

Government Polytechnic Rajkot−360003.