A CHARACTERIZATION OF (Cn;K1;n)-SUPERMAGIC OF TREES CORONA PATHS AND TREES JOIN A TRIVIAL GRAPH
Let H1 and H2 be two simple connected graphs. A graph G = (V (G);E(G)) admits an (H1;H2)-covering, where H1 and H2 are two subgraphs of G, if every edge in E(G) belongs to at least one subgraph of G isomorphic to H1 or H2. The graph G is called an (H1;H2)-magic, if there exists a bijective functi...
Saved in:
| Main Author: | |
|---|---|
| Format: | Theses |
| Language: | Indonesia |
| Subjects: | |
| Online Access: | https://digilib.itb.ac.id/gdl/view/32165 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Institut Teknologi Bandung |
| Language: | Indonesia |