Show simple item record

dc.creatorJeyanthi, P.
dc.creatorSelvi, M.
dc.creatorRamya, D.
dc.date2020-04-23
dc.date.accessioned2020-05-19T17:01:22Z
dc.date.available2020-05-19T17:01:22Z
dc.identifierhttps://www.revistaproyecciones.cl/article/view/4118
dc.identifier10.22199/issn.0717-6279-2020-02-0017
dc.identifier.urihttps://revistaschilenas.uchile.cl/handle/2250/134097
dc.descriptionLet G = (V,E) be a graph with p vertices and q edges. Consider an injection f : V (G) → {1, 2, 3, ..., pq}. Define f∗ : E(G) → {T1, T2, T3, ..., Tq}, where Tq is the qth triangular number such that f∗(e) =   for all edges e = uv. If f∗(E(G)) is a sequence of consecutive triangular numbers T1, T2, T3, ..., Tq, then the function f is said to be restricted triangular difference mean. A graph that admits restricted triangular difference mean labeling is called restricted triangular difference mean graph. In this paper, we investigate restricted triangular difference mean behaviour of some standard graph.en-US
dc.formatapplication/pdf
dc.languageeng
dc.publisherUniversidad Católica del Norte.en-US
dc.relationhttps://www.revistaproyecciones.cl/article/view/4118/3359
dc.rightsCopyright (c) 2020 P. Jeyanthi, M. Selvi, D. Ramyaen-US
dc.rightshttp://creativecommons.org/licenses/by/4.0en-US
dc.sourceProyecciones (Antofagasta, On line); Vol 39 No 2 (2020); 275-286en-US
dc.sourceProyecciones. Revista de Matemática; Vol. 39 Núm. 2 (2020); 275-286es-ES
dc.source0717-6279
dc.subjectRestricted triangular difference mean labelingen-US
dc.subject05C78en-US
dc.subjectGraph labelling (graceful graphs, bandwidth, etc.)en-US
dc.titleRestricted triangular difference mean graphsen-US
dc.typeinfo:eu-repo/semantics/article
dc.typeinfo:eu-repo/semantics/publishedVersion
dc.typePeer-reviewed Articleen-US
dc.typetexten-US


This item appears in the following Collection(s)

Show simple item record