Uniformly Weighted Star-Factors of Graphs

zbMATH Open1313.05166arXiv0707.0227MaRDI QIDQ2936728FDOQ2936728

Qinglin Roger Yu, Y. Wu

Publication date: 6 January 2015

Abstract: A {it star-factor} of a graph $G$ is a spanning subgraph of $G$ such that each component of which is a star. An {it edge-weighting} of $G$ is a function $w:E(G)longrightarrowmathbb{N}^{+}$, where $mathbb{N}^{+}$ is the set of positive integers. Let $Omega$ be the family of all graphs $G$ such that every star-factor of $G$ has the same weights under a fixed edge-weighting $w$. In this paper, we present a simple structural characterization of the graphs in $Omega$ that have girth at least five.

Full work available at URL: https://arxiv.org/abs/0707.0227

zbMATH Keywords

girthedge-weightingstar-factoruniform star-factor

Mathematics Subject Classification ID

Signed and weighted graphs (05C22) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cited In (2)

• Uniform Star-factors of Graphs with Girth Three
• Star-uniform graphs

This page was built for publication: Uniformly Weighted Star-Factors of Graphs

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