Abstract
A graph G of order n and vertex set V(G) = {v1, v2,…,vn} and edge set E(G) is said to be prime labeled if there exists a permutation σ ∊ Sn such that vσ(i)vσ(j) ∊ E(G) implies σ(i),σ(j) = 1 for all 1 ≤ i, j ≤ n. In this paper we determine all the prime labeled selfcomplementary graphs.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Journal of Discrete Mathematical Sciences and Cryptography
Paper Title
Journal
Date
