Let T¹ₙ = (V,E₁) and T²ₙ = (V,E₂) be the trees on n vertices with $V=v₀,v₁,...,v_{n-1}$, $E₁=v₀v₁,...,v₀v_{n-3},v_{n-4}{v}_{n-2},v_{n-3}{v}_{n-1}$ and $E₂=v₀v₁,...,v₀v_{n-3},v_{n-3}{v}_{n-2},v_{n-3}{v}_{n-1}$. For p ≥ n ≥ 5 we obtain explicit formulas for ex(p;T¹ₙ) and ex(p;T²ₙ), where ex(p;L) denotes the maximal number of edges in a graph of order p not containing L as a subgraph. Let r(G₁,G₂) be the Ramsey number of the two graphs G₁ and G₂. We also obtain some explicit formulas for $r(Tₘ,T{ₙ}^i)$, where i ∈ 1,2 and Tₘ is a tree on m vertices with Δ(Tₘ) ≤ m - 3.

This article presents two simple deterministic algorithms for finding the Minimum Spanning Tree in $O\left(\right|V|+|E\left|\right)$ time for any non-trivial class of graphs closed on graph minors. This applies in particular to planar graphs and graphs of bounded genus. Both algorithms run on a pointer machine and they require no a priori knowledge of the structure of the class except for its density. Edge weights are only compared.

The problem of embedding graphs into other graphs is much studied in the graph theory. In fact, much effort has been devoted to determining the conditions under which a graph G is a subgraph of a graph H, having a particular structure. An important class to study is the set of graphs which are embeddable into a hypercube. This importance results from the remarkable properties of the hypercube and its use in several domains, such as: the coding theory, transfer of information, multicriteria rule,...

The problem of embedding graphs into other graphs is much studied in the graph theory. In fact, much effort has been devoted to determining the conditions under which a graph G is a subgraph of a graph H, having a particular structure. An important class to study is the set of graphs which are embeddable into a hypercube. This importance results from the remarkable properties of the hypercube and its use in several domains, such as: the coding theory, transfer of information, multicriteria rule,...

We define new combinatorial objects, called shrubs, such that forests of rooted trees are shrubs. We then introduce a structure of operad on shrubs. We show that this operad is contained in the Zinbiel operad, by using the inclusion of Zinbiel in the operad of moulds. We also prove that this inclusion is compatible with the richer structure of anticyclic operad that exists on Zinbiel and on moulds.

Vertex colorings of the square of an outerplanar graph have received a lot of attention recently. In this article we prove that the chromatic number of the square of an outerplanar graph of maximum degree Δ = 6 is 7. The optimal upper bound for the chromatic number of the square of an outerplanar graph of maximum degree Δ ≠ 6 is known. Hence, this mentioned chromatic number of 7 is the last and only unknown upper bound of the chromatic number in terms of Δ.

A set $S$ of vertices in a graph $G$ is called a paired-dominating set if it dominates $V$ and $\langle S\rangle$ contains at least one perfect matching. We characterize the set of vertices of a tree that are contained in all minimum paired-dominating sets of the tree.

A dominating set $D\subseteq V\left(G\right)$ is a weakly connected dominating set in $G$ if the subgraph $G{\left[D\right]}_w=(N_G\left[D\right],E_w)$ weakly induced by $D$ is connected, where $E_w$ is the set of all edges having at least one vertex in $D$. Weakly connected domination number${\gamma }_w\left(G\right)$ of a graph $G$ is the minimum cardinality among all weakly connected dominating sets in $G$. A graph $G$ is said to be weakly connected domination stable or just ${\gamma }_w$-stable if ${\gamma }_w\left(G\right)={\gamma }_w(G+e)$ for every edge $e$ belonging to the complement $\overline{G}$ of $G.$ We provide a constructive characterization of weakly connected domination...

The Wiener index, W, is the sum of distances between all pairs of vertices in a graph G. The quadratic line graph is defined as L(L(G)), where L(G) is the line graph of G. A generalized star S is a tree consisting of Δ ≥ 3 paths with the unique common endvertex. A relation between the Wiener index of S and of its quadratic graph is presented. It is shown that generalized stars having the property W(S) = W(L(L(S)) exist only for 4 ≤ Δ ≤ 6. Infinite families of generalized stars with this property...

The Wiener index of a connected graph is defined as the sum of the distances between all unordered pairs of its vertices. We characterize the graphs which extremize the Wiener index among all graphs on $n$ vertices with $k$ pendant vertices. We also characterize the graph which minimizes the Wiener index over the graphs on $n$ vertices with $s$ cut-vertices.