Multidecompositions of the Balanced Complete Bipartite Graph into Paths and Stars | Zendy

Hung-Chih Lee | Zendy; Yen-Po Chu | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Multidecompositions of the Balanced Complete Bipartite Graph into Paths and Stars

Author(s) -

Hung-Chih Lee,

Yen-Po Chu

Publication year - 2013

Publication title -

isrn combinatorics

Language(s) - English

Resource type - Journals

ISSN - 2090-8911

DOI - 10.1155/2013/398473

Subject(s) - bipartite graph , combinatorics , complete bipartite graph , partition (number theory) , mathematics , stars , graph , star (game theory) , path (computing) , edge transitive graph , discrete mathematics , voltage graph , computer science , line graph , computer network , mathematical analysis , computer vision

Let and denote a path and a star with edges, respectively. For graphs , , and , a -multidecomposition of is a partition of the edge set of into copies of and copies of with at least one copy of and at least one copy of . In this paper, necessary and sufficient conditions for the existence of the (, )-multidecomposition of the balanced complete bipartite graph are given.

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