Joining caterpillars and stability of the tree center

1Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.

Abstract

The path-tableP (T) of a tree T collects information regarding the paths in T: for each vertex v, the row of P (T) relative to v lists the number of paths containing v of the various lengths. We call this row the path-row of v in T. Two trees having the same path-table (up to reordering the rows) are called path-congruent (or path-isomorphic). Motivated by Kelly-Ulam's Reconstruction Conjecture and its variants, we have looked for new necessary and sufficient conditions for isomorphisms between two trees. Path-congruent trees need not be isomorphic, although they are similar in some respects. In [P. Dulio, V. Pannone, Trees with path-stable center, Ars Combinatoria, LXXX (2006) 153-175] we have introduced the concepts of trunkTr (T) of a tree T and ramificationram v of a vertex v ∈ V (Tr (T)), and proved that, if the ramification of the central vertices attains its minimum or maximum value, then the path-row of a central vertex is "unique", i.e. it is different from the path-row of any non-central vertex (in fact, this uniqueness property of a central path-row holds for all trees of diameter less than 8, regardless of the ramification values). In this paper we prove that, for all other values of the ramification, and for all diameters greater than 7, there are trees in which the above uniqueness fails. © 2007 Elsevier B.V. All rights reserved.

Cite

CITATION STYLE

APA

Dulio, P., & Pannone, V. (2008). Joining caterpillars and stability of the tree center. Discrete Mathematics, 308(7), 1185–1190. https://doi.org/10.1016/j.disc.2007.04.006

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free