Arbitrarily vertex decomposable caterpillars with four or five leaves

Sylwia Cichacz; Agnieszka Görlich; Antoni Marczyk; Jakub Przybyło; Mariusz Woźniak

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

Displaying similar documents to “Arbitrarily vertex decomposable caterpillars with four or five leaves”

On $k$ -pairable graphs from trees

Zhongyuan Che (2007)

Czechoslovak Mathematical Journal

Similarity:

The concept of the $k$ -pairable graphs was introduced by Zhibo Chen (On $k$ -pairable graphs, Discrete Mathematics 287 (2004), 11–15) as an extension of hypercubes and graphs with an antipodal isomorphism. In the same paper, Chen also introduced a new graph parameter $p (G)$ , called the pair length of a graph $G$ , as the maximum $k$ such that $G$ is $k$ -pairable and $p (G) = 0$ if $G$ is not $k$ -pairable for any positive integer $k$ . In this paper, we answer the two open questions raised by Chen in the case that the graphs...

Bounds On The Disjunctive Total Domination Number Of A Tree

Michael A. Henning, Viroshan Naicker (2016)

Discussiones Mathematicae Graph Theory

Similarity:

Let G be a graph with no isolated vertex. In this paper, we study a parameter that is a relaxation of arguably the most important domination parameter, namely the total domination number, γt(G). A set S of vertices in G is a disjunctive total dominating set of G if every vertex is adjacent to a vertex of S or has at least two vertices in S at distance 2 from it. The disjunctive total domination number, [...] γtd(G) $γ_{t}^{d} (G)$ , is the minimum cardinality of such a set. We observe that [...] γtd(G)≤γt(G)...

A remark on branch weights in countable trees

Bohdan Zelinka (2004)

Mathematica Bohemica

Similarity:

Let $T$ be a tree, let $u$ be its vertex. The branch weight $b (u)$ of $u$ is the maximum number of vertices of a branch of $T$ at $u$ . The set of vertices $u$ of $T$ in which $b (u)$ attains its minimum is the branch weight centroid $B (T)$ of $T$ . For finite trees the present author proved that $B (T)$ coincides with the median of $T$ , therefore it consists of one vertex or of two adjacent vertices. In this paper we show that for infinite countable trees the situation is quite different.

Minimum degree, leaf number and traceability

Simon Mukwembi (2013)

Czechoslovak Mathematical Journal

Similarity:

Let $G$ be a finite connected graph with minimum degree $δ$ . The leaf number $L (G)$ of $G$ is defined as the maximum number of leaf vertices contained in a spanning tree of $G$ . We prove that if $δ \geq \frac{1}{2} (L (G) + 1)$ , then $G$ is 2-connected. Further, we deduce, for graphs of girth greater than 4, that if $δ \geq \frac{1}{2} (L (G) + 1)$ , then $G$ contains a spanning path. This provides a partial solution to a conjecture of the computer program Graffiti.pc [DeLaVi na and Waller, Spanning trees with many leaves and average distance, Electron. J. Combin....

Coalescing Fiedler and core vertices

Didar A. Ali, John Baptist Gauci, Irene Sciriha, Khidir R. Sharaf (2016)

Czechoslovak Mathematical Journal

Similarity:

The nullity of a graph $G$ is the multiplicity of zero as an eigenvalue in the spectrum of its adjacency matrix. From the interlacing theorem, derived from Cauchy’s inequalities for matrices, a vertex of a graph can be a core vertex if, on deleting the vertex, the nullity decreases, or a Fiedler vertex, otherwise. We adopt a graph theoretical approach to determine conditions required for the identification of a pair of prescribed types of root vertices of two graphs to form a cut-vertex...

On arbitrarily vertex decomposable unicyclic graphs with dominating cycle

Sylwia Cichacz, Irmina A. Zioło (2006)

Discussiones Mathematicae Graph Theory

Similarity:

A graph G of order n is called arbitrarily vertex decomposable if for each sequence (n₁,...,nₖ) of positive integers such that $\sum_{i = 1}^{k} n_{i} = n$ , there exists a partition (V₁,...,Vₖ) of vertex set of G such that for every i ∈ 1,...,k the set $V_{i}$ induces a connected subgraph of G on $n_{i}$ vertices. We consider arbitrarily vertex decomposable unicyclic graphs with dominating cycle. We also characterize all such graphs with at most four hanging vertices such that exactly two of them have a common neighbour. ...

Displaying similar documents to “Arbitrarily vertex decomposable caterpillars with four or five leaves”

On k -pairable graphs from trees

Bounds On The Disjunctive Total Domination Number Of A Tree

A remark on branch weights in countable trees

Minimum degree, leaf number and traceability

Coalescing Fiedler and core vertices

On arbitrarily vertex decomposable unicyclic graphs with dominating cycle

On $k$ -pairable graphs from trees