Contents

Ars Combinatoria

  • Research article

\(E_3\)-Cordial Graphs

I. Cahit1, R. Yilmaz1
1Department of Mathematics and Computer Science Eastern Mediterranean University G. Magosa, North Cyprus
  • Published: 31/01/2000

Abstract

In this paper, generalizations of edge-cordial labelings are introduced and studied for special classes of trees and graphs.

Information
Guidelines
CP Initiatives
Follow CP
Facebook X-twitter Linkedin

1970-2025 CP (Manitoba, Canada) unless otherwise stated.

Citation
I. Cahit, R. Yilmaz. \(E_3\)-Cordial Graphs[J], Ars Combinatoria, Volume 054. 119-127. DOI: .