Uniformly Weighted Star-Factors of Graphs
| dc.creator | Wu, Yunjian | |
| dc.creator | Yu, Qinglin | |
| dc.date | 2007-07-02 | |
| dc.date.accessioned | 2026-07-07T08:13:32Z | |
| dc.date.available | 2026-07-07T08:13:32Z | |
| dc.description | 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)\longrightarrow \mathbb{N}^+$, where $\mathbb{N}^+$ is the set of positive integers. Let $Ω$ 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 $Ω$ that have girth at least five. | |
| dc.identifier | https://arxiv.org/abs/0707.0227 | |
| dc.identifier | http://arxiv.org/abs/0707.0227 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/132802 | |
| dc.subject | Combinatorics | |
| dc.subject | 05C69, 05C70 | |
| dc.title | Uniformly Weighted Star-Factors of Graphs | |
| dc.type | text |