Sign in
Back
On Prime Labeled Self-Complementary Graphs
Journal article   Peer reviewed

On Prime Labeled Self-Complementary Graphs

A. A. George Michael and M. Z. Youssef
Journal of discrete mathematical sciences & cryptography, Vol.17(3), pp.239-256
04/05/2014
DOI: https://doi.org/10.1080/09720529.2013.858501

Abstract

Mathematics Mathematics, Applied Physical Sciences Science & Technology
A graph G of order n and vertex set V(G) = {v(1), v(2),...,v(n)} and edge set E(G) is said to be prime labeled if there exists a permutation sigma is an element of Sn such that v(sigma(i)) v(sigma(j)) is an element of E(G) implies sigma(i), sigma(j) = 1 for all 1 <= i, j <= n. In this paper we determine all the prime labeled self-complementary graphs.

Metrics

1 Record Views

Details