On double-star decomposition of graphs | Zendy

Saieed Akbari | Zendy; Shahab Haghi | Zendy; Hamid Reza Maimani | Zendy; Abbas Seify | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

On double-star decomposition of graphs

Author(s) -

Saieed Akbari,

Shahab Haghi,

Hamid Reza Maimani,

Abbas Seify

Publication year - 2016

Publication title -

discussiones mathematicae graph theory

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.476

H-Index - 19

eISSN - 2083-5892

pISSN - 1234-3099

DOI - 10.7151/dmgt.1933

Subject(s) - mathematics , combinatorics , star (game theory) , decomposition , discrete mathematics , chemistry , mathematical analysis , organic chemistry

A tree containing exactly two non-pendant vertices is called a double-star. A double-star with degree sequence (k1 + 1, k2 + 1, 1, . . . , 1) is denoted by Sk1,k2. We study the edge-decomposition of graphs into double-stars. It was proved that every double-star of size k decomposes every 2k-regular graph. In this paper, we extend this result by showing that every graph in which every vertex has degree 2k + 1 or 2k + 2 and containing a 2-factor is decomposed into Sk1,k2 and Sk1−1,k2, for all positive integers k1 and k2 such that k1 + k2 = k

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research