Decomposition of product graphs into paths and stars with three edges

MaRDI QIDQ5206550zbMATH OpenFDO

Authors A. Pauline Ezhilarasi, A. Muthusamy

Publication date 18 December 2019

zbMATH Keywords

graph decompositionpathstar and product graph

Mathematics Subject Classification ID

Graph designs and isomorphic decomposition (05C51) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph operations (line graphs, products, etc.) (05C76)

Recommendations

• Decomposition of product graphs into paths and stars on five vertices
• Decomposition of product graphs into paths and cycles of length four
• Decomposition of complete graphs into paths and stars
• Decomposition of the complete bipartite graph with a 1-factor removed into paths and stars
• Multidecompositions of the balanced complete bipartite graph into paths and stars

Cited in

(10)

• Decompositions of graphs based on a new graph product
• Decomposition of complete equipartite graphs into paths and cycles of length 2p
• A study on the pendant number of graph products
• Graph decompositions for cartesian products
• Decomposition of product graphs into paths and stars on five vertices
• Decomposition of Cartesian product of complete graphs into paths and stars with four edges
• Decomposition of product graphs into paths and cycles of length four
• Multi-decomposition of Cartesian product of complete graph into kites and stars of size four
• Multi-decomposition of product graphs into kites and stars on four edges
• Decomposition of the Cartesian product of complete graphs into paths and cycles of length six

This page was built for publication: Decomposition of product graphs into paths and stars with three edges

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5206550)