Back to Search
Start Over
Complex uniformly resolvable decompositions of Kv
- Publication Year :
- 2021
-
Abstract
- In this paper we consider the complex uniformly resolvable decompositions of the complete graph $K_v$ into subgraphs such that each resolution class contains only blocks isomorphic to the same graph from a given set $\mathcal H$. We completely determine the spectrum for the cases $\mathcal{H} = \{K_2, P_3, K_3\}$, $\mathcal{H} = \{P_4, C_4\}$, and $\mathcal{H} = \{K_2, P_4, C_4\}$.<br />Comment: 11 pages
- Subjects :
- Class (set theory)
Algebra and Number Theory
Mathematics::Combinatorics
Spectrum (functional analysis)
Complete graph
Resolvable decomposition
Cycle
Complex uniformly resolvable decomposition
Theoretical Computer Science
Combinatorics
Mathematics::K-Theory and Homology
Computer Science::Discrete Mathematics
Path (graph theory)
FOS: Mathematics
Mathematics - Combinatorics
Discrete Mathematics and Combinatorics
Graph (abstract data type)
05C51, 05C38, 05C70
Path
Geometry and Topology
Combinatorics (math.CO)
Computer Science::Data Structures and Algorithms
Mathematics
Resolution (algebra)
Subjects
Details
- Language :
- English
- Database :
- OpenAIRE
- Accession number :
- edsair.doi.dedup.....1279ce21446afb1a1fd816182d8cf45b