On the structure of path-like trees

F.A. Muntaner-Batle; Miquel Rius-Font

Discussiones Mathematicae Graph Theory (2008)

  • Volume: 28, Issue: 2, page 249-265
  • ISSN: 2083-5892

Abstract

top
We study the structure of path-like trees. In order to do this, we introduce a set of trees that we call expandable trees. In this paper we also generalize the concept of path-like trees and we call such generalization generalized path-like trees. As in the case of path-like trees, generalized path-like trees, have very nice labeling properties.

How to cite

top

F.A. Muntaner-Batle, and Miquel Rius-Font. "On the structure of path-like trees." Discussiones Mathematicae Graph Theory 28.2 (2008): 249-265. <http://eudml.org/doc/270757>.

@article{F2008,
abstract = {We study the structure of path-like trees. In order to do this, we introduce a set of trees that we call expandable trees. In this paper we also generalize the concept of path-like trees and we call such generalization generalized path-like trees. As in the case of path-like trees, generalized path-like trees, have very nice labeling properties.},
author = {F.A. Muntaner-Batle, Miquel Rius-Font},
journal = {Discussiones Mathematicae Graph Theory},
keywords = {tree; path-like tree; Tₚ-tree; expandable tree; α-valuation; super edge-magic labeling; special super edge-magic labeling; harmonious labeling; super edge-antimagic labeling; -tree; -valuation},
language = {eng},
number = {2},
pages = {249-265},
title = {On the structure of path-like trees},
url = {http://eudml.org/doc/270757},
volume = {28},
year = {2008},
}

TY - JOUR
AU - F.A. Muntaner-Batle
AU - Miquel Rius-Font
TI - On the structure of path-like trees
JO - Discussiones Mathematicae Graph Theory
PY - 2008
VL - 28
IS - 2
SP - 249
EP - 265
AB - We study the structure of path-like trees. In order to do this, we introduce a set of trees that we call expandable trees. In this paper we also generalize the concept of path-like trees and we call such generalization generalized path-like trees. As in the case of path-like trees, generalized path-like trees, have very nice labeling properties.
LA - eng
KW - tree; path-like tree; Tₚ-tree; expandable tree; α-valuation; super edge-magic labeling; special super edge-magic labeling; harmonious labeling; super edge-antimagic labeling; -tree; -valuation
UR - http://eudml.org/doc/270757
ER -

References

top
  1. [1] B.D. Acharya, Elementary parallel transforamtions of graphs, AKCE International J. Graphs and Combin. 1 (2004) 63-67. Zbl1065.05090
  2. [2] M. Bača, Y. Lin and F.A. Muntaner-Batle, Super edge-antimagic labelings of the path-like trees, Utilitas Math., to appear. Zbl1140.05049
  3. [3] M. Bača, Y. Lin and F.A. Muntaner-Batle, Normalized embeddings of path-like treess, Utilitas Math. 73 (2007) 117-128. Zbl1140.05049
  4. [4] C. Barrientos, Difference Vertex Labelings, Ph.D. Thesis (Universitat Politècnica de Catalunya, 2004). 
  5. [5] G. Chartrand and L. Lesniak, Graphs and Digraphs, second edition (Wadsworth & Brooks/Cole Advanced Books and Software, Monterey, 1986). Zbl0666.05001
  6. [6] R.M. Figueroa-Centeno, R. Ichishima and F.A. Muntaner-Batle, On super edge-magic graphs, Ars Combin. 64 (2002) 81-95. Zbl1071.05568
  7. [7] J.A. Gallian, A dynamic survey of graph labeling, The Electronic Journal of Combinatorics DS6 (2000). Zbl0953.05067
  8. [8] R.L. Graham and N.J. Sloane, On additive bases and harmonious graphs, SIAM J. Alg. Discrete Math. 1 (1980) 382-404, doi: 10.1137/0601045. Zbl0499.05049
  9. [9] S.M. Hegde and S. Shetty, On graceful trees, Appl. Math. E-Notes 2 (2002) 192-197. Zbl1014.05057
  10. [10] F.A. Muntaner-Batle, Special super edge-magic labelings of bipartite graphs, J. Combin. Math. Combin. Comput. 39 (2001) 107-120. Zbl0989.05105
  11. [11] A. Rosa, On certain valuations of the vertices of a graph, in: Theory of Graphs, Internat. Symposium, Rome, July 1966 (Gordon and Breach, N.Y. and Dunot, Paris, 1967) 349-355. 

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.