"The Cordiality of Cone and Lemniscate Graphs" by Ashraf Elrokh, Yasser Elmshtaye et al.
  •  
  •  
 

Applied Mathematics & Information Sciences

Author Country (or Countries)

Egypt

Abstract

A graph is said to be cordial if it has 0-1 labeling that satisfies certain conditions |v0 − v1 | ≤ 1 and |e0 − e1 | ≤ 1. In this paper we present necessary and sufficient conditions for cone and lemniscate graphs to be cordial.

Digital Object Identifier (DOI)

http://dx.doi.org/10.18576/amis/160620

Plum Print visual indicator of research metrics
PlumX Metrics
  • Citations
    • Citation Indexes: 4
  • Usage
    • Downloads: 38
    • Abstract Views: 7
  • Captures
    • Readers: 1
see details

Share

COinS