| Full text | |
| Author(s): |
Cerioli, Marcia R.
;
Fernandes, Cristina G.
;
Lee, Orlando
;
Lintzmayer, Carla N.
;
Mota, Guilherme O.
;
da Silva, Candida N.
Total Authors: 6
|
| Document type: | Journal article |
| Source: | ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE; v. 346, p. 9-pg., 2019-08-30. |
| Abstract | |
Given an n-vertex graph G = (V, E) with m edges, a labeling f of V boolean OR E that uses all the labels in the set {1, 2, ..., n + m} is edge-magic if there is an integer k such that f (u) (v) f (uv) = k for every edge uv is an element of E. Furthermore, if the labels in {1, 2, ..., n} are given to the vertices, then f is called super edge-magic. Kotzig [On magic valuations of trichromatic graphs, Reports of the CRM, 1971] started the investigation of super edge-magic labelings of forests. Following this line of research, we prove that some forests of stars admit a super edge-magic labeling and that some forests of caterpillars admit an edge-magic labeling. (AU) | |
| FAPESP's process: | 18/04876-1 - Ramsey theory, structural graph theory and applications in Bioinformatics |
| Grantee: | Guilherme Oliveira Mota |
| Support Opportunities: | Research Grants - Young Investigators Grants |
| FAPESP's process: | 15/11937-9 - Investigation of hard problems from the algorithmic and structural stand points |
| Grantee: | Flávio Keidi Miyazawa |
| Support Opportunities: | Research Projects - Thematic Grants |
| FAPESP's process: | 13/03447-6 - Combinatorial structures, optimization, and algorithms in theoretical Computer Science |
| Grantee: | Carlos Eduardo Ferreira |
| Support Opportunities: | Research Projects - Thematic Grants |