Restricted triangular difference mean graphs
DOI:
https://doi.org/10.22199/issn.0717-6279-2020-02-0017Keywords:
Restricted triangular difference mean labelingAbstract
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.
References
F. Harary, Graph theory. Reading, MA: Addison-Wesley, 1972.
J. Gallian, “A dynamic survey of graph labeling”, 22th ed. The electronics journal of combinatorics, vol. # DS6, p. 535, 2019, doi: 10.37236/27.
P. Jeyanthi, M. Selvi, and D. Ramya, “Triangular difference mean graphs”, International journal of mathematical combinatorics, to appear.
Published
How to Cite
Issue
Section
-
Attribution — You must give appropriate credit, provide a link to the license, and indicate if changes were made. You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
- No additional restrictions — You may not apply legal terms or technological measures that legally restrict others from doing anything the license permits.
