Edge consecutive gracefulness of a graph

dc.contributor.author	Pereira, J.
dc.contributor.author	Singh, T.
dc.contributor.author	Arumugam, S.
dc.date.accessioned	2019-08-05T10:50:14Z
dc.date.available	2019-08-05T10:50:14Z
dc.date.issued	2019
dc.identifier.citation	Discrete Applied Mathematics. 280; 2020; 214-220.	en_US
dc.identifier.uri	https://www.sciencedirect.com/science/article/pii/S0166218X18304840
dc.identifier.uri	http://irgu.unigoa.ac.in/drs/handle/unigoa/5793
dc.description.abstract	We present several basic results on ecg and use this parameter to prove that any connected graph G can be embedded as an induced subgraph of a graceful graph and as an induced subgraph of an eulerian graceful graph.	en_US
dc.publisher	Elsevier	en_US
dc.subject	Mathematics	en_US
dc.title	Edge consecutive gracefulness of a graph	en_US
dc.type	Journal article	en_US
dc.identifier.impf	y