Skolem difference mean labeling of disconnected graphs
DOI:
https://doi.org/10.4067/S0716-09172017000200347Keywords:
Mean labeling, Skolem difference mean labeling, Skolem difference mean graphAbstract
Downloads
Download data is not yet available.
References
[1] HARARY, F. (1972) Graph theory. Massachusetts: Addison Wesley.
[2] GALLIAN, JOSEPH A. (2015) A Dynamic Survey of Graph Labeling. EN: The Electronic Journal of Combinatorics. [s.l.: s.n.].
[3] MURUGAN, K. (2012) Subramanaian, Labeling of finite union of paths. EN: International Journal of Mathematics and Soft Computing, 2, (1). [s.l.: s.n.], 99-108.
[4] MURUGAN, K. (2011) Subramanaian, Skolem difference mean labeling of Hgraphs, International Journal of Mathematics and Soft Computing, 1, (1). [s.l.: s.n.], 115-129.
[5] MURUGAN, K. (2015) Some Results on Skolem Difference Mean Graphs, International Journal of Mathematics and its Applications, 3, (3-D). [s.l.: s.n.], 75-80.
[6] RAMYA, D. (2013) On skolem difference mean labeling of graphs. EN: International Journal of Mathematical Archive, 4, (12). [s.l.: s.n.], 73-79.
[7] SELVI, M. (2015) Skolem difference mean Graphs. EN: Proyecciones Journal of Mathematics, 34 (3). [s.l.: s.n.], 243-254.
[8] SOMASUNDARAM, S. (2003) Mean labelings of graphs. EN: National Academy Science Letter, (26). [s.l.: s.n.], 210-213.
[2] GALLIAN, JOSEPH A. (2015) A Dynamic Survey of Graph Labeling. EN: The Electronic Journal of Combinatorics. [s.l.: s.n.].
[3] MURUGAN, K. (2012) Subramanaian, Labeling of finite union of paths. EN: International Journal of Mathematics and Soft Computing, 2, (1). [s.l.: s.n.], 99-108.
[4] MURUGAN, K. (2011) Subramanaian, Skolem difference mean labeling of Hgraphs, International Journal of Mathematics and Soft Computing, 1, (1). [s.l.: s.n.], 115-129.
[5] MURUGAN, K. (2015) Some Results on Skolem Difference Mean Graphs, International Journal of Mathematics and its Applications, 3, (3-D). [s.l.: s.n.], 75-80.
[6] RAMYA, D. (2013) On skolem difference mean labeling of graphs. EN: International Journal of Mathematical Archive, 4, (12). [s.l.: s.n.], 73-79.
[7] SELVI, M. (2015) Skolem difference mean Graphs. EN: Proyecciones Journal of Mathematics, 34 (3). [s.l.: s.n.], 243-254.
[8] SOMASUNDARAM, S. (2003) Mean labelings of graphs. EN: National Academy Science Letter, (26). [s.l.: s.n.], 210-213.
Downloads
Published
2017-06-02
Issue
Section
Artículos
License
-
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.
How to Cite
[1]
“Skolem difference mean labeling of disconnected graphs”, Proyecciones (Antofagasta, On line), vol. 36, no. 2, pp. 347–361, Jun. 2017, doi: 10.4067/S0716-09172017000200347.
