|
Communications on Applied Electronics
Foundation of Computer Science (FCS), NY, USA
|
| Volume 6 - Issue 9 |
| Published: Apr 2017 |
| Authors: N. Murugesan, R.Uma |
10.5120/cae2017652560
|
N. Murugesan, R.Uma . Super Vertex Graceful Graphs. Communications on Applied Electronics. 6, 9 (Apr 2017), 38-42. DOI=10.5120/cae2017652560
@article{ 10.5120/cae2017652560,
author = { N. Murugesan,R.Uma },
title = { Super Vertex Graceful Graphs },
journal = { Communications on Applied Electronics },
year = { 2017 },
volume = { 6 },
number = { 9 },
pages = { 38-42 },
doi = { 10.5120/cae2017652560 },
publisher = { Foundation of Computer Science (FCS), NY, USA }
}
%0 Journal Article
%D 2017
%A N. Murugesan
%A R.Uma
%T Super Vertex Graceful Graphs%T
%J Communications on Applied Electronics
%V 6
%N 9
%P 38-42
%R 10.5120/cae2017652560
%I Foundation of Computer Science (FCS), NY, USA
For a defined graph labeling, there exists a number of bijective functions for a graph of defined order and size which leads to different graphs. In this paper, a mathematical tool is developed to find the number of super vertex graceful graphs for a defined order “p” and size “q”.