1 / 12

EDGE-DISJOINT ISOMORPHIC MULTICOLORED TREES AND CYCLES IN COMPLETE GRAPHS

EDGE-DISJOINT ISOMORPHIC MULTICOLORED TREES AND CYCLES IN COMPLETE GRAPHS. 應數 100 9622053 吳家寶. Abstract. Author Gregory M. Constantine Publisher Society for Industrial and Applied Mathematics Philadelphia, PA, USA Year of Publication: 2005 . Abstract. It is shown that:

malaya
Download Presentation

EDGE-DISJOINT ISOMORPHIC MULTICOLORED TREES AND CYCLES IN COMPLETE GRAPHS

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. EDGE-DISJOINT ISOMORPHIC MULTICOLORED TREES AND CYCLES IN COMPLETE GRAPHS 應數1009622053吳家寶

  2. Abstract • Author Gregory M. Constantine • PublisherSociety for Industrial and Applied MathematicsPhiladelphia, PA, USA • Year of Publication:2005

  3. Abstract It is shown that: • a complete graph with a prime numberp(>2) of vertices can be properly edge-colored withpcolors in such a way that the edges can be partitioned into edge-disjoint multicolored Hamitonian cycles. • When the number of vertices is n (≧8), withna power of two or five times a power of two, a proper edge-coloring of the complete graph exists such that its edges can be partitioned into isomorphic multicolored spanning trees.

  4. Basic terminology • Edge-disjoint :two subgraphs are edge disjoint if they do not share common edges. e.g.

  5. Basic terminology • Multicolored :A graph with colored edges is called multicolored if no two of its edges have the same color. e.g.

  6. Basic terminology • Proper :A coloring of edges of a graph is proper if, whenever two edges have one vertex in common, they carry different colors. e.g.

  7. Basic terminology • unicycle :A connected graph with m vertices and m edges is called a unicycle. e.g.

  8. Background • A classical result of Euler,that the edges of K2n can be partitioned into isomorphic spanning trees (paths). e.g. • Euler also decomposed K2n+1 into n edge-disjoint Hamiltonian cycles. 1 2 we have two paths : 1-2-4-3 and 4-1-3-2 , They are isomorphic spanning paths in K4 4 3

  9. Theorem (a) • For p(>2) prime there exists a proper edge coloring of Kp that admits a partition of edges into multicolored Hamiltonian cycles. Pf: 建立一個演算法. e.g. 1 2 5 1 1 1 3 4 2 2 3 5 5 4 4 3 3 4 5 2

  10. Theorem (b) • For n=2m, m≧3, or n=5*2m, m≧1, there exists a proper edge coloring of Kn that admits a partition of edges into isomorphic multicolored spanning trees. Pf: 略. e.g. 1 2 1 2 6 6 3 3 5 4 5 4

  11. Conjecture • Any proper coloring of the edges of a complete graph on an odd number of vertices allows a partition of the edges into multicolored isomorphic unicyclic subgraphs. • Any proper coloring of the edges of a complete graph on an even number (more than four) of vertices allows a partition of the edges into multicolored isomorphic spanning trees.

  12. Thanks for yours listening!

More Related