Search
Close this search box.

Contents

Journal of Combinatorial Mathematics and Combinatorial Computing

  • Research article

The Forcing Semi-H-cordial Numbers of Certain Graphs

R. Khoeilar1, S. M. Sheikholeslami1, Abdollah Khodkar2
1Department of Mathematics Azarbaijan University of Tarbiat Moallem, Tabriz, Iran
2Department of Mathematics, University of West Georgia Carrollton, GA 30118
  • Published: 30/11/2006

Abstract

A labeling \( f \) of a graph \( G \) is called semi-H-cordial if for each vertex \( v \), \( |f(v)| \leq 1 \), \( |e_f(1) – e_f(-1)| \leq 1 \) and \( |v_f(1) – v_f(-1)| \leq 1 \). In this paper we study the forcing semi-H-cordial numbers of paths, cycles, stars, trees, Dutch-windmill graphs, wheels, grids and cylinders.

Information
Guidelines
CP Initiatives
Follow CP
Facebook Twitter Linkedin
1970-2024 CP (Manitoba, Canada) unless otherwise stated.
Citation
R. Khoeilar, S. M. Sheikholeslami, Abdollah Khodkar. The Forcing Semi-H-cordial Numbers of Certain Graphs[J], Journal of Combinatorial Mathematics and Combinatorial Computing, Volume 059. 151-164. DOI: .