Fibonacci and Telephone Numbers in Extremal Trees

Urszula Bednarz; Iwona Włoch

The search session has expired. Please query the service again.

Displaying similar documents to “Fibonacci and Telephone Numbers in Extremal Trees”

Descents in noncrossing trees.

Hough, David S. (2003)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Noncrossing trees and noncrossing graphs.

Chen, William Y.C., Yan, Sherry H.F. (2006)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Graphs with Large Generalized (Edge-)Connectivity

Xueliang Li, Yaping Mao (2016)

Discussiones Mathematicae Graph Theory

Similarity:

The generalized k-connectivity κk(G) of a graph G, introduced by Hager in 1985, is a nice generalization of the classical connectivity. Recently, as a natural counterpart, we proposed the concept of generalized k-edge-connectivity λk(G). In this paper, graphs of order n such that [...] for even k are characterized.

On the number of independent sets in a tree.

Law, Hiu-Fai (2010)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Determination of Large Families and Diameter of Equiseparable Trees

Zoran Stanić (2006)

Publications de l'Institut Mathématique

Similarity:

From paths to stars.

Alameddine, A.F. (1991)

International Journal of Mathematics and Mathematical Sciences

Similarity:

On the number of genus one labeled circle trees.

Mészáros, Karola (2007)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

On Sequences $G_{n}$ satisfying $G_{n} = (d + 2) G_{n - 1} - G_{n - 2}$ .

Chen, Ricky X.F., Shapiro, Louis W. (2007)

Journal of Integer Sequences [electronic only]

Similarity:

Bijective census and random generation of Eulerian planar maps with prescribed vertex degrees.

Schaeffer, Gilles (1997)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Almost all trees have an even number of independent sets.

Wagner, Stephan G. (2009)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Counting two-graphs related to trees.

Cameron, Peter J. (1995)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

A combinatorial derivation of the number of labeled forests.

Callan, David (2003)

Journal of Integer Sequences [electronic only]

Similarity:

Graphs with 3-Rainbow Index n − 1 and n − 2

Xueliang Li, Ingo Schiermeyer, Kang Yang, Yan Zhao (2015)

Discussiones Mathematicae Graph Theory

Similarity:

Let G = (V (G),E(G)) be a nontrivial connected graph of order n with an edge-coloring c : E(G) → {1, 2, . . . , q}, q ∈ N, where adjacent edges may be colored the same. A tree T in G is a rainbow tree if no two edges of T receive the same color. For a vertex set S ⊆ V (G), a tree connecting S in G is called an S-tree. The minimum number of colors that are needed in an edge-coloring of G such that there is a rainbow S-tree for each k-subset S of V (G) is called the k-rainbow index of...

Lower bound on the domination number of a tree

Magdalena Lemańska (2004)

Discussiones Mathematicae Graph Theory

Similarity:

>We prove that the domination number γ(T) of a tree T on n ≥ 3 vertices and with n₁ endvertices satisfies inequality γ(T) ≥ (n+2-n₁)/3 and we characterize the extremal graphs.