Bounds on the size of super edge-magic graphs depending on the girth
Let G = (V,E) be a graph of order p and size q. It is known that if G is super edge-magic graph then q 2p−3. Furthermore, if G is super edge-magic and q = 2p−3, then the girth of G is 3. It is also known that if the girth of G is at least 4 and G is super edge-magic then q 2p − 5. In this paper we s...
| Autores: | , , |
|---|---|
| Tipo de recurso: | informe técnico |
| Fecha de publicación: | 2009 |
| País: | España |
| Institución: | Universitat Politècnica de Catalunya (UPC) |
| Repositorio: | UPCommons. Portal del coneixement obert de la UPC |
| Idioma: | inglés |
| OAI Identifier: | oai:upcommons.upc.edu:2117/7063 |
| Acceso en línea: | https://hdl.handle.net/2117/7063 |
| Access Level: | acceso abierto |
| Palabra clave: | Graph theory Computer science--Mathematics Grafs, Teoria de Matemàtica Àrees temàtiques de la UPC::Matemàtiques i estadística::Matemàtica discreta::Teoria de grafs |
| Sumario: | Let G = (V,E) be a graph of order p and size q. It is known that if G is super edge-magic graph then q 2p−3. Furthermore, if G is super edge-magic and q = 2p−3, then the girth of G is 3. It is also known that if the girth of G is at least 4 and G is super edge-magic then q 2p − 5. In this paper we show that there are infinitely many graphs which are super edge-magic, have girth 5, and q = 2p−5. Therefore the maximum size for super edge-magic graphs of girth 5 cannot be reduced with respect to the maximum size of super edge-magic graphs of girth 4. |
|---|