Decompositions and Factorizations of Complete Graphs

Petr Kovář ()
Additional contact information
Petr Kovář: Technical University Ostrava, Department of Applied Mathematics

Chapter Chapter 7 in Structural Analysis of Complex Networks, 2011, pp 169-196 from Springer

Abstract: Abstract Graph decompositions into isomorphic copies of a given graph are a well-established topic studied in both graph theory and design theory. Although spanning tree factorizations may seem to be just a special case of this concept, not many general results are known. We investigate necessary and sufficient conditions for a graph factorization into isomorphic spanning trees to exist.

Keywords: Graph decomposition; Graph factorization; Graph labeling (search for similar items in EconPapers)
Date: 2011
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-0-8176-4789-6_7

Ordering information: This item can be ordered from
http://www.springer.com/9780817647896

DOI: 10.1007/978-0-8176-4789-6_7

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().