On Fibonacci numbers and edge coloured trees
An edge-coloring of a graph G is an assignment of colors or labels to the edges of the graph. If {A,B} is a set of two colors used to color the edges of G, then a B-monochromatic subgraph of G is a subgraph H of G induced by B-colored edges of G. We say that G is (A 2B)-edge colored if the set of ed...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | text |
| Language: | English |
| Published: |
Animo Repository
2018
|
| Subjects: | |
| Online Access: | https://animorepository.dlsu.edu.ph/etd_bachelors/18585 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | De La Salle University |
| Language: | English |