dc.creator | Jeyanthi, P. | |
dc.creator | Selvi, M. | |
dc.creator | Ramya, D. | |
dc.date | 2020-04-23 | |
dc.date.accessioned | 2020-05-19T17:01:22Z | |
dc.date.available | 2020-05-19T17:01:22Z | |
dc.identifier | https://www.revistaproyecciones.cl/article/view/4118 | |
dc.identifier | 10.22199/issn.0717-6279-2020-02-0017 | |
dc.identifier.uri | https://revistaschilenas.uchile.cl/handle/2250/134097 | |
dc.description | Let 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.format | application/pdf | |
dc.language | eng | |
dc.publisher | Universidad Católica del Norte. | en-US |
dc.relation | https://www.revistaproyecciones.cl/article/view/4118/3359 | |
dc.rights | Copyright (c) 2020 P. Jeyanthi, M. Selvi, D. Ramya | en-US |
dc.rights | http://creativecommons.org/licenses/by/4.0 | en-US |
dc.source | Proyecciones (Antofagasta, On line); Vol 39 No 2 (2020); 275-286 | en-US |
dc.source | Proyecciones. Revista de Matemática; Vol. 39 Núm. 2 (2020); 275-286 | es-ES |
dc.source | 0717-6279 | |
dc.subject | Restricted triangular difference mean labeling | en-US |
dc.subject | 05C78 | en-US |
dc.subject | Graph labelling (graceful graphs, bandwidth, etc.) | en-US |
dc.title | Restricted triangular difference mean graphs | en-US |
dc.type | info:eu-repo/semantics/article | |
dc.type | info:eu-repo/semantics/publishedVersion | |
dc.type | Peer-reviewed Article | en-US |
dc.type | text | en-US |