Uniformly resolvable decompositions of $K_v$ into one $1$-factor and $n$-stars when $n>1$ is odd

We consider uniformly resolvable decompositions of $K_v$ into subgraphs such that each resolution class contains only blocks isomorphic to the same graph. We give a complete solution for the case in which one resolution class is $K_2$ and the rest are $K_{1,n}$ where $n>1$ is odd.

Institutions

Publication Details

Journal
ArXiv.org
Published
2025-04-21
Primary Topic
graph theory and CDMA systems
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Uniformly resolvable decompositions of $K_v$ into one $1$-factor and $n$-stars when $n>1$ is odd

ArXiv.org
graph theory and CDMA systems
article

Uniformly resolvable decompositions of $K_v$ into one $1$-factor and $n$-stars when $n>1$ is odd

article en

Abstract

We consider uniformly resolvable decompositions of $K_v$ into subgraphs such that each resolution class contains only blocks isomorphic to the same graph. We give a complete solution for the case in which one resolution class is $K_2$ and the rest are $K_{1,n}$ where $n>1$ is odd.

ArXiv.org
Michigan Technological University (US)
Openalex Percentile: Top 53%
graph theory and CDMA systems
Open Access PDFOpenAlex
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Uniformly resolvable decompositions of $K_v$ into one $1$-factor and $n$-stars when $n>1$ is odd · ArXiv.org (2025) | TGRS Research Map | TGRS