JOURNAL ARTICLE
r-Regular, r-connected decompositions of complete graphs
Herbert FleischnerW. R. JohnstoneA. J. W. Hilton
Year: 2000 Journal: Journal of Combinatorial Designs Vol: 8 (1)Pages: 15-21 Publisher: Wiley
Abstract
If r|(n-1) and rn is even, then Kn can be expressed as the union of edge-disjoint isomorphic r-regular r-connected factors. © 2000 John Wiley & Sons, Inc. J Combin Designs 8: 15–21, 2000
Keywords:
Mathematics Combinatorics Disjoint sets Strongly regular graph Disjoint union (topology) Enhanced Data Rates for GSM Evolution Discrete mathematics Graph Pathwidth Line graph Computer science Artificial intelligence
Metrics
1
Cited By
0.38
FWCI (Field Weighted Citation Impact)
4
Refs
0.65
Citation Normalized Percentile
Is in top 1%
Is in top 10%
Topics
graph theory and CDMA systems
Physical Sciences → Engineering → Electrical and Electronic Engineering
Advanced Graph Theory Research
Physical Sciences → Computer Science → Computational Theory and Mathematics
Finite Group Theory Research
Physical Sciences → Mathematics → Discrete Mathematics and Combinatorics
Related Documents
JOURNAL ARTICLE
Longest cycles in r-regular r-connected graphs
Journal: Journal of Combinatorial Theory Series B Year: 1982 Vol: 32 (3)Pages: 231-245
JOURNAL ARTICLE
Cyclability of r-regular r-connected graphs
William McCuaigMoshe Rosenfeld
Journal: Bulletin of the Australian Mathematical Society Year: 1984 Vol: 29 (1)Pages: 1-11
JOURNAL ARTICLE
Kaleidoscopic edge-coloring of complete graphs and r-regular graphs
Journal: Discussiones Mathematicae Graph Theory Year: 2018 Vol: 39 (4)Pages: 881-881
JOURNAL ARTICLE
(R, 2, R(R-1))-Regular Graphs
N. R. Santhi MaheswariC. Sekar
Journal: International Journal of Mathematics and Soft Computing Year: 2012 Vol: 2 (2)Pages: 25-25
JOURNAL ARTICLE
On r-regular r-connected non-hamiltonian graphs
Journal: Bulletin of the Australian Mathematical Society Year: 1981 Vol: 24 (2)Pages: 205-220