Strong labelings of linear forests

View/Open
Document typeArticle
Defense date2009-11-15
Rights accessOpen Access
Except where otherwise noted, content on this work
is licensed under a Creative Commons license
:
Attribution-NonCommercial-NoDerivs 3.0 Spain
Abstract
A (p, q)-graph G is called super edge-magic if there exists a bijective function f : V (G) ∪
E(G) → {1, 2, . . . , p+q} such that f(u)+f(v)+f(uv) is a constant for each uv ∈ E(G) and f(V (G)) =
{1, 2, . . . , p}.
In this paper, we introduce the concept of strong super edge-magic labeling as a particular class
of super edge-magic labelings and we use such labelings in order to show that the number of super
edge-magic labelings of an odd union of path-like trees (mT), all of them of the same order, grows at
least exponentially with m.
CitationBaca, M. [et al.]. Strong labelings of linear forests. "Acta mathematica sinica. English series", 15 Novembre 2009, vol. 25, núm. 12, p. 1951-1964.
ISSN1439-8516
Publisher versionhttp://www.springerlink.com/content/01h6602383137270/fulltext.pdf
Files | Description | Size | Format | View |
---|---|---|---|---|
strong_labeling.pdf | Articel principal | 383,1Kb | View/Open |